[no_toc]

Talks

• Laura Kovács: Automating Game Reasoning in Blockchain Security (details)
• Jan von Plato (University of Helsinki): Jan von Plato: Two Gödelian Topics in Modal Logic (details)
• Georg Metcalfe (University of Bern): Substructural Logics with Minimally True Tautologies (details)
• Rajeev Gore (Monash University -- Melbourne, Australia): CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SAT (details)
• Guillermo Badia: Logical Characterizations of Weighted Complexity Classes (details)
• David Pearce: Logic, Accountability, and Design (details)
• Georg Gottlob: Artificial Intelligence and Artificial Ignorance (details)
• Nick Bezhanishvili: Degrees of the Finite Model Property for Superintuitionistic and Modal Logics (details)
• Byron Cook: Business of Proofs (details)
• Reiner Hähnle: Context-aware Trace Contracts (details)
• Emiliano Lorini: A Rule-based Modal View of Causal Reasoning (details)
• Valeria de Paiva: Women in Logic Online - Network Mathematics (details)
• Adnan Darwiche: Beyond truth and falsehood: Logic as a Calculus of Events (details)
• Petra Mutzel (University of Bonn): Algorithmic Data Science on Graphs (details)
• Hans van Ditmarsch (CNRS, France): Distributed Knowledge Revisited (details)
• Carla P. Gomes and Bart Selman: Exploring Connections: Wittgenstein, Gödel, and ChatGPT (details)
• Dov Gabbay: Logic and argumentation for the 21st century (details)
• Dr. Ran Gelles: Distributed Computations in Fully-Defective Networks (details)
• Hans van Ditmarsch: Reasoning about Gossip (details)
• Manfred Scheucher (TU Berlin): A brief introduction to Combinatorial Geometry (details)
• Moshe Y. Vardi: From Greek Paradoxes to Political Paradoxes (details)
• Lutz Strassburger: Combinatorial Proofs and Decomposition Theorems for First-order Logic (details)
• Hans van Ditmarsch: One Hundred Prisoners and a Light Bulb (details)
• Joscha Bach: Cognitive AI: From AI models to mental representations? (details)
• Georg Gottlob: Knowledge Processing, Logic, and the Future of AI (details)
• Cory Doctorow: Working as Intended -- Surveillance Capitalism is not a Rogue Capitalism (details)
• Torsten Schaub: Dynamic Answer Set Programming (details)
• Joost-Pieter Katoen : Probabilistic Programming: Machine Learning for the Masses? (details)
• Tommaso Moraschini : Profinite Heyting algebras and the representation problem for Esakia spaces (details)
• Dominique Larchey-Wendling: Hilbert’s Tenth Problem in Coq (details)
• Prafullkumar Tale: Lossy Kernels for Graph Contraction Problems (details)
• Davide Grossi: Credulous Acceptability, Poison Games and Modal Logic (details)
• Ringo Baumann: An Abstract, Logical Approach to Characterizing Strong Equivalence in Non-monotonic Knowledge Representation Formalisms (details)
• David Cerna : A Mobile Application for Self-Guided Study of Formal Reasoning (details)
• Gerd Brewka: Admissibility and Completeness Revisited (details)
• Tanja Schindler : A DPLL(T) theory solver for quantified formulas (details)
• Alexej Rotar : The Satisfiability Problem for Fragments of PCTL (details)
• Martin Munoz: Descriptive Complexity for Counting Complexity Classes (details)
• Yuri Gurevich: LOGIC in computer science and software industry (and in mathematics, time permitting) (details)
• Dana Scott: Free Logic: its Formalization and some Applications (details)
• Joshua Blinkhorn: Building Strategies into DQBF Proofs (details)
• Juliet Floyd: In and Out of Mind: Wittgenstein and Gödel, Post and Turing (details)
• John D. Barrow: 100 Years of Universes (details)
• Alessio Gizzi: Multiphysics modeling of nonlinear cardiac dynamics: Experiments, Theory and Simulations (details)
• Andrea Cali: Querying Web Data: A Computational Perspective (details)
• Andreas Pieris : Counting Database Repairs under Primary Keys Revisited (details)
• Peter Stuckey: The Multi-Agent Path Finding Problem (details)
• Olivia Erdélyi : Why Bother With Regulation and Ethics? We Just Develop the Technology... (details)
• Daniel Le Berre: Recursive Explore and Check Abstraction Refinement (RECAR) (details)
• Mateus de Oliveira Oliveira : Some Width Measures for Proofs (details)
• Anne Schreuder : Automatic Synthesis of Polynomial Probabilistic Invariants via Geometric Persistence (details)
• Arnaud Durand: Introduction to dependence logic and team semantics (details)
• Colin Toal: Developing software and ML models at IBM, Amazon and integrate.ai (details)
• David Basin : Security Protocols: Model Checking Standards (details)
• Peter Eades: How to Draw a Graph ... Revisited (details)
• Manuel Sorge: Clustered, but when? From static to temporal graph algorithms (details)
• Dominik Peters : Truthful Aggregation of Budget Proposals (details)
• Stefan Milius: Eilenberg Theorems for Free (details)
• Francesco Scarcello: Tree projection width and fixed-parameter tractable queries (details)
• Fabrizio Montecchiani : Advances on 1-planar graphs (details)
• Alice Miller : Probabilistic model checking for UAV strategy generation (details)
• Marijn Heule: Massively Parallel Solving of Math Problems (details)
• Sanjay Modgil : Logic, Argument and Dialectic (details)
• Fredrik Heintz: Reasoning and Learning over Streams for Safe Autonomous Systems (details)
• Sebastian Rudolph: The Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics (details)
• Vladimir Lifschitz: How We Studied the Input Language of gringo (details)
• Moshe Vardi : How the Hippies Destroyed the Internet (details)
• Luca Cardelli : Programming with Chemical Reactions (details)
• Dale Miller : Separating Functional Computation from Relations (details)
• Marcello D'Agostino: An informational view of classical logic (details)
• Martin Grohe: The Graph Isomorphism Problem (details)
• Tomi Janhunen: Writing Declarative Specifications for Clauses (details)
• Rajeev Gore: Interactive Synthesis of Verified Vote-counting Programs (details)
• Toby Walsh: Living with Artificial Intelligence – How to stay Human (details)
• Iyad Kanj: How to navigate through obstacles? (details)
• Markus Endres: Preference-Aware Database Systems (details)
• Steven Chaplick: Approximation Schemes for Geometric Coverage Problems (details)
• Torsten Schaub: ASP in Time (details)
• Ramchandra Phawade: Combining free choice and time in Petri nets (details)
• Ronald de Haan: Using Knowledge Compilation in Social Choice (details)
• Martin Josef Geige: Solving large-scale, mid-term planning problems under multiple objectives – A contribution to VeRoLog 2017 optimization competition (details)
• Gyula O.H. Katona: Cryptology, Isoperimetric Problems and Shadows (details)
• Christian Klamler: Using Borda Scores for Ranking Sets of Objects (details)
• Daniel Paulusma: Colouring Square-Free Graphs without Long Induced Paths (details)
• Henning Fernau: Self-monitoring approximation algorithms (details)
• Benjamin Niedermann: On Ortho-Radial Drawings for Metro Networks (details)
• Jorge Fandinno: Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports (details)
• Przemysław Andrzej Wałęga: Horn fragments of Halpern-Shoham logic: complexity vs expressiveness (details)
• Eunjung Kim: Erdos-Posa Property of Chordless Cycles and its Applications (details)
• Maarten Löffler: Pleaching Pencil-&-Paper Picture Puzzles (details)
• Mohammad Farshi: (Weakly) Self-approaching graphs (details)
• Sasha Rubin: Mini course: Milestones in solving games on graphs (details)
• Piotr Skowron: Approximating Optimal Social Choice under Metric Preferences (details)
• Tamara Mchedlidze: Application of the point-line duality principle in graph drawing (details)
• Gerhard Woeginger: Buffers, Buckets, and Overflows (details)
• Francesco Scarcello: Dealing with the Shapley Value: islands of tractability and useful tools (details)
• Roman Prutkin: Graph Embeddings Motivated by Greedy Routing (details)
• Emilia Oikarinen: Minimum-Width Confidence Bands via Constraint Optimization (details)
• Matti Järvisalo: The Implicit Hitting Set Approach and Preprocessing for Maximum Satisfiability Solving (details)
• Iyad Kanj: The complexity of tree partitioning (details)
• Odile Papini: Prioritized Assertional-Based Removed Sets Revision of DL-Lite Belief Bases (details)
• Vladislav Ryzhikov and Michael Zakharyaschev : Horn fragments of temporal logics and ontology-based access to temporal data (details)
• Filippo Bonchi: Full Abstraction for Signal Flow Graphs (details)
• Danny Hermelin: Fractals for Kernelization Lower Bounds (details)
• Ondřej Kunčar: CoCon: A Non-Leaking Conference System (details)
• Rupak Majumdar: [Software Testing] Hitting families of schedules (details)
• Victor Dalmau: Approximation of MIN CSP (details)
• Johannes Kinder: High System-Code Security with Low Overhead (details)
• Tomáš Vojnar: Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems (details)
• Evgenij Thorstensen: Self join elimination and new notions of query containment (details)
• Jörg Rothe: Economics and Computation: Five Challenges in Algorithmic Game Theory, Computational Social Choice, and Fair Division (details)
• Martin Schäf: Classifying Bugs with Interpolants (details)
• Igor Razgon: Lower bounds for branching programs of bounded repetition computing CNFs of bounded treewidth: an overview (details)
• Idit Keidar: Transactional Data Structure Libraries (details)
• Leslie Lamport: A Mathematical View of Computer Systems – Q&A (details)
• Tom van Dijk: Workers in forests: developments in parallel decision diagrams (details)
• Joseph Sifakis: Rigorous System Design in BIP (details)
• O-Joung Kwon: Deletion problems regarding graphs of bounded rank-width (details)
• Cliff B. Jones: Reasoning about Interference (or Lack Thereof) (details)
• Evgenia Ternovska: An Algebra of Modular Systems (details)
• Johannes Hölzl: Markov chains and Markov decision processes in Isabelle/HOL (details)
• Pierre Bourhis: A Formal Study of Collaborative Access Control in Distributed Datalog (details)
• Keren Censor-Hillel: Distributed Algorithms as Combinatorial Structures (details)
• Maria Gorinova: Termination proving (details)
• Martin Suda: Resolution-based Methods for Linear Temporal Reasoning (details)
• Sayan Mitra: Automating invariant and progress proofs for distributed systems (details)
• Bertrand Meyer: A Theory of Programs (details)
• Miroslav Truszczynski: Abstract Perspectives on Modularity in Knowledge Representation (details)
• Piero Bonatti: DL^N: a utilitarian nonmonotonic description logic (details)
• Alexey Ignatiev: Efficient Model Based Diagnosis with Maximum Satisfiability (details)
• Caterina Urban: Abstract Interpretation as Automated Deduction (details)
• Sarah Kirchner: Appointment scheduling in hospitals - sequencing and scheduling using time aggregation (details)
• Stephan Holzer: New Algorithms and Lower Bounds in Distributed Computing (details)
• Alexandru Popa: Algorithmic and Hardness Results for the Colorful Components Problems (details)
• Paolo Papotti: Beyond declarative data cleaning (details)
• Dana S. Scott: Can Modalities Save Naive Set Theory? (details)
• Peter Stadler: Dynamic Programming for Lazy Bastards (details)
• Wolfgang Gatterbauer: The Linearization of Pairwise Markov Random Fields (details)
• Tomas Vojnar: From Pointers to List Containers (details)
• András Vörös: Saturation-based incremental LTL model checking with inductive proofs (details)
• Wolfgang Dvorak: Welfare Maximization with Friends-of-Friends Network Externalities (details)
• Hubie Chen: The Logic of Counting Query Answers: A Study via Existential Positive Queries (details)
• Yoram Moses: Principles of Coordination in Multi-agent Systems (details)
• Neng-Fa Zhou: The Picat Language and System (details)
• Andrej Bauer: An Introduction to Algebraic Effects and Handlers (details)
• James Anderson: Graph Decomposition for Large-Scale Dynamical System Analysis (details)
• Hannes Strass: Abstract Argumentation and Approximation Fixpoint Theory (details)
• Roopsha Samanta: Succinct Representation of Concurrent Trace Sets (details)
• Iyad Kanj: On Bounded-Degree Plane Geometric Spanners (details)
• Helmut Seidl: Parametric Strategy Iteration (details)
• Gordon Cichon: Formal Semantics of Synchronous Transfer Architecture (details)
• Christian Scheideler: Towards a rigorous base for the design of P2P systems (details)
• Pavithra Prabhakar: Algorithmic Verification of Stability of Hybrid Systems (details)
• Lenore D. Zuck: Parameterized Verification: Theory and Practice (details)
• Nathan Wasser: Abstraction On-Demand: Automatically Generating Invariants for Loops and Recursive Method Calls (details)
• Vinay K. Chaudhri: An Architecture for Intelligence Using Prototypes, Composition and Analogy (details)
• Stefan Mengel: Understanding model counting for beta-acyclic CNF-formulas (details)
• Johann A. Makowsky: Sets and Logic for CS: How to teach what is useful (details)
• Marco Maratea: Multi-Engine Answer Set Programming (details)
• M. S. Ramanujan: Solving d-SAT via backdoors to small treewidth (details)
• Ringo Baumann: Context-free and Context-sensitive Kernels: Update and Deletion Equivalence in Abstract Argumentation (details)
• EunJung Kim: A parameterized algorithm for tree-cut width. (details)
• Jeff Z. Pan: Approximate Reasoning for Description Logics based Ontologies (details)
• Sebastian Ordyniak: A more general approach for Backdoor Sets into SAT and CSP (details)
• Anthony Widjaja Lin: A linear-time algorithm for the orbit problem over cyclic groups (details)
• Gábor Erdélyi: Algorithms and Elections (details)
• Massimiliano Giacomin: An input/output characterization of abstract argumentation frameworks and semantics (details)
• Jakob Lechner: Mitigation of Transient Faults and Timing Variations in GALS Circuits (details)
• Son Cao Tran: Combining ASP and Prolog (details)
• M. S. Ramanujan : Parameterized Algorithms to Preserve Connectivity (details)
• Matthias Mnich: A Complexity Dichotomy for the Steiner Multicut Problem (details)
• Franz Wotawa: Test automation – How far shall we go? (details)
• Adam Rogalewicz: The Tree Width of Separation Logic with Recursive Definitions (details)
• Mira Mezini: From Active to Reactive Objects (details)
• Petr Rockai: Explicit State Model Checking with DIVINE (details)
• George Metcalfe: Proof Theory for Lattice-Ordered Groups (details)
• Esko Turunen: Pavelka style fuzzy logic over Chang's MV-algebra (details)
• Alfons Laarman: Multi-Core Model Checking (details)
• Pedro Calabar: Setting the stage for ASP functions (details)
• Aniello Murano: Enriched Modal Logics (details)
• Meghyn Bienvenu: Inconsistency-tolerant semantics for ontology-based data access (details)
• Sicun Gao: Delta-Decisions over the Reals (details)
• Chao Wang: Symbolic Predictive Analysis for Improving the Reliability and Security of Concurrent Software (details)
• Kewen Wang: Phase Transition in Answer Set Programming (details)
• Christoph Haase: Graph-Based Approaches to Reasoning in Separation Logic (details)
• Iyad Kanj: On the Ordered List Subgraph Embedding Problems (details)
• Borzoo Bonakdarpou: Automated synthesis of Fault-tolerant Distributed Algorithms (details)
• Johann A. Makowsky: Characterizing word functions recognized by weighted automata (details)
• Joel Ouaknine: A Survey of Classical and Real-Time Verification (details)
• Christoph Weidenbach: The Design of Automated Reasoning Systems (details)
• Alexey Gotsman: Abstraction for Weakly Consistent Systems (details)
• Doron Peled: Concurrent Software Synthesis: Old Challenge - New Ideas (details)
• Donald Knuth: All questions answered (details)
• Peter Robinson: Sublinear Bounds for Randomized Leader Election (details)
• Andre Platzer: How to Prove Your Robot Safe (details)
• Hubie Chen: Meditations on Quantified Constraint Satisfaction (details)
• Wilfried Steiner: Model-Checking Fault-Tolerant Clock Synchronization Protocols (details)
• Reiner Hähnle: Abstract Symbolic Execution (details)
• Torsten Schaub: Potassco, the Potsdam Answer Set Solving Collection. (details)
• EunJung Kim: Linear kernels and single-exponential algorithms via protrusion decompositions (details)
• Diego Calvanese: Verification of Relational Data-Centric Dynamic Systems with External Services (details)
• Pietro Baroni: Abstract argumentation semantics: from limits to perspectives (details)
• Loris Bozzato: CKR: a general framework for context in Semantic Web (details)
• Samanta Roopsha: Robustness Analysis of Networked Systems (details)
• Javier Esparza: Parameterized Verification of Asynchronous Shared-Memory Systems (details)
• Alexander Pretschner: Model-Based Security Testing: From Models to the Real World (details)
• Andrey Rybalchenko: Program verification as constraint solving (also for existential and universal CTL properties) (details)
• Tomer Kotek: Applications of logic in graph theory: definability of graph invariants (details)
• Madalina Erascu: Computational Logic and Quantifier Elimination Techniques for (Semi-)automatic Static Analysis and Synthesis of Algorithms (details)
• Christoph Lenzen: Fast Routing Table Construction Using Small Messages (details)
• Miroslaw Truszczynski: Connecting first-order ASP and the logic FO(ID) through reducts (details)
• James Delgrande: Revising Horn Theories (details)
• Andreas Griesmayer: Model checking Business Processes with Multi-Agent Systems (details)
• Leonid Libkin: Graph Logics and Relations on Words (details)
• Robert Ganian: Generalizing vertex cover as a graph parameter (details)
• Xavier Rival: MemCAD, a Modular Abstract Domain for Reasoning on Memory States (details)
• Workshop on Logic and Algebra: Workshop on Logic and Algebra (details)
• Florent Madelaine: On the complexity of the model checking problem for syntactic fragments of first-order logic (details)
• Iyad Kanj: What makes normalized weighted satisfiability tractable (details)
• Ruslan L. Smeliansky: Computer Systems Laboratory – Skills, Experience, Main Research Directions (details)
• Werner Dietl: Verification Games: Making Verification Fun (details)
• Ana Sokolova: Quantitative Relaxation of Concurrent Data Structure (details)
• Vladimir Zakharov: Automata-theoretic approach to the equivalence checking problem for sequential programs (details)
• Vladimir Zakharov: Equivalence Checking Problem: 1953 - 2011 (survey) (details)
• Stefan Szeider: Mini-Workshop on Logic, Proofs and Algorithms (details)
• Nikolaj Bjorner: Taking Satisfiability to the Next Level with Z3 (details)
• Byron Cook: A New Approach to Temporal Property Verification (details)
• Justyna Petke: On the bridge between Constraint Satisfaction and Boolean Satisfiability (details)
• Neeldhara Misra: From FVS to F-deletion: the Story of a Simple Algorithm (details)
• Hubie Chen: Decomposing First-Order Logic (details)
• Christoph Lenzen: Improved Bounds for Byzantine Self-stabilizing Clock Synchronization (details)
• Workshop: Concepts and Meaning: Concepts and Meaning -- Workshop in honour of Alexander Leitsch's 60th Birthday (details)
• Meghyn Bienvenu: On the compexity of querying data through ontologies (details)
• D. Eckert, C. Klamler: TUTORIAL: Social Choice - problems, results, tools and recent extensions (details)
• Simone Bova: Expression Complexity of Conjunctive Queries (details)
• Giorgio Levi: Abstract interpretation: from theory to applications (details)
• Jasmin Fisher: From Coding the Genome to Algorithms Decoding Life (details)
• Laura Kovacs: Playing in the Grey Area of Proofs (details)
• Ana Sokolova: Course on Coalgebra in Computer Science (details)
• Johannes Fürnkranz: Course on Inductive Rule Learning (details)
• Daniel Paulusma: Lift Contractions (details)
• Olga Tveretina: Relative Efficiency of Propositional Proof Systems Based on Resolution and OBDDs (details)
• Edmund M. Clarke: 30 Years of Model Checking (details)
• Joao Marques-Silva: Practical Algorithms for Minimal Unsatisfiable Core Extraction (details)
• Georg Weissenbacher: Battling Bugs with Interpolants (details)
• Fedor V. Fomin: Kernelization Algorithms (details)
• Thomas A. Henzinger: Formal Specification and Verification of Markovian Population Models (details)
• Moritz Müller: On lower bounds for Res(k) (details)
• Daniel Lokshtanov: Generalization and Specialization of Kernelization (details)
• Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: Parameterized Above Average (details)
• Pierre Marquis: A Few Words about Knowledge Compilation (details)
• Bart Jansen: Kernelization for a Hierarchy of Structural Parameters (details)
• Michael R. Fellows: Kernelization and the Larger Picture of Practical Algorithmics, in Contemporary Context (details)
• Sourav Chakraborty: Property Testing: Sublinear Algorithms for Promise Problems (details)
• Armin Biere: Preprocessing and Inprocessing Techniques in SAT (details)
• Fedor V. Fomin: Protrusions in graphs and their applications (details)

Events

The following people have visited the Vienna Center for Logic and Algorithms for one or more of our events:

Winter School on Verification, 6-10 February 2012

• Gábor Alagi, ELTE Budapest 
• Simon Außerlechner, TU Graz
• Armin Biere, JKU Linz
• Frantisek Blahoudek, Masaryk University Brno
• Roderick Bloem, TU Graz
• Bart Bogaerts, KU Leuven
• Brankica Bratic, University of Novi Sad
• Petra Brosch, TU Vienna
• Christian Cerncic, Austrian Institute of Technology
• Krishnendu Chatterjee, IST Austria
• Jelena Colic, University of Novi Sad
• Yulia Demyanova, TU Vienna
• Ioan Dragan, TU Vienna
• Uwe Egly, TU Vienna
• Andreas Fröhlich, JKU Linz
• Sebastian Gabmeyer, TU Vienna
• Karl Gmeiner, TU Vienna
• Patrice Godefroid, Microsoft Research
• Aleksandr Golovnev, St. Petersburg University
• Alexandra Goultiaeva, University of Toronto
• Radu Grosu, TU Vienna Emre Gul, Koc University
• Alexandru Gyori, Politehnica University of Timisoara
• Thomas A. Henzinger, IST Austria
• Georg Hofferek, TU Graz
• Milena Vujosevic Janicic, Belgrade University
• Annu John, TU Vienna
• Ioana Jucu, TU Vienna
• Ayrat Khalimov, TU Graz
• David Klaška, Masaryk University Brno
• Miroslav Klimoš, Masaryk University Brno
• Robert Koenighofer, TU Graz
• Lubos Korenciak, Masaryk University Brno
• Laura Kovacs, TU Vienna
• Gergely Kovasznai, JKU Linz
• Bernhard Kragl, TU Vienna
• Jan Krcal, Masaryk University Brno
• Kujtim Rahmani, SS Cyril and Methodius University of Macedonia
• Ismail Kuru, KOC University
• Jean-Marie Lagniez, JKU Linz
• Sabine Laszakovits, TU Vienna
• Michael Lippautz, University of Salzburg
• Bojan Marinkovic, Serbian Academy of Sciences and Arts
• Darko Martinovikj, SS Cyril and Methodius University of Macedonia
• Martin Milata, Masaryk University Brno
• Ada Neagu, TU Vienna
• Aina Niemetz, JKU Linz
• Petr Novotny, Masaryk University Brno
• Thomas Pani, TU Vienna
• Ivan Petrushenko, University of Kiev
• Mathias Preiner, JKU Linz
• Thomas Reinbacher, TU Vienna
• Vikram Saralaya, TU Eindhoven
• Ulrich Schmid, TU Vienna
• Martina Seidl, JKU Linz
• Kristina Spirovska, SS Cyril and Methodius University of Macedonia
• Robert Stoegbuchner, TU Graz
• Zlatka Trajcheska, SS Cyril and Methodius University of Macedonia
• Helmut Veith, TU Vienna
• Magdalena Widl, TU Vienna
• Jakob Zwirchmayr, TU Vienna

VCLA Opening, January 2012

• Roderick Bloem, Graz University of Technology, Austria
• Edmund M. Clarke, Carnegie Mellon University, US
• Thomas A. Henzinger, Institute of Science and Technology Austria
• Fedor V. Fomin, University of Bergen, Norway
• Georg Weissenbacher, Princeton University, US
• Joao Marques-Silva, University College Dublin / IST/INESC-ID 

Workshop on non-classical Logics

• Libor Behounek, Academy of Sciences of the Czech Republic
• Marta Bilkova, Charles University, Prague, Czech Republic
• Felix Bou, Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
• Leonardo Cabrer, University of Bern, Switzerland
• Karel Chvalovsky, Academy of Sciences of the Czech Republic
• Petr Cintula, Academy of Sciences of the Czech Republic
• Jose Gil Ferez, University of Barcelona, Spain
• Tommaso Flaminio, Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
• Lluis Godo, Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
• Zuzana Hanikova, Academy of Sciences of the Czech Republic
• Rotislav Horcik, Academy of Sciences of the Czech Republic
• Tomas Kroupa, Academy of Sciences of the Czech Republic
• Roman Kuznets, University of Bern, Switzerland
• Paolo Maffezioli, University of Florence, Italy
• Enrico Marchioni, Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
• George Metcalfe, University of Bern, Switzerland
• Richard McKinley, University of Bern, Switzerland
• Nicola Olivetti, Paul Cézanne University, Aix-Marseille, France
• Christoph Roethlisberger, University of Bern, Switzerland
• Jiri Velebil, Czech Technical University, Prague, Czech Republic
• Thomas Vetterlein, Johannes Kepler University, Linz, Austria
• Martin Vita, Prague, Czech Republic
• Anna Zamansky, Vienna University of Technology / Tel Aviv University

WorKer 2011

• Faisal Abu-Khzam, Lebanese American University, Lebanon
• Rémy Belmonte, University of Bergen, Norway
• Armin Biere, Johannes Kepler University, Linz, Austria
• Sourav Chakraborty, Chennai Mathematical Institute, India
• Robert Crowston, Royal Holloway, University of London, UK
• Michael R. Fellows, Charles Darwin University, Australia
• Henning Fernau, Universität Trier, Germany
• Fedor Fomin, University of Bergen, Norway
• Archontia Giannopoulou, National and Kapodistrian University of Athens, Greece
• Jiong Guo, University of Saarland, Germany
• Gregory Gutin, Royal Holloway, University of London, UK
• Sepp Hartung, TU Berlin, Germany
• Pinar Heggernes, University of Bergen, Norway
• Marijn Heule, Delft University of Technology, The Netherlands
• Pim van ‘t Hof, University of Bergen, Norway
• Falk Hüffner, TU Berlin, Germany
• Bart Jansen, Utrecht University, the Netherlands
• Matti Järvisalo, University of Helsinki, Finland
• Mark Jones, Royal Holloway, University of London, United Kingdom
• Eunjung Kim, CNRS, France
• Stefan Kratsch, Utrecht University, The Netherlands
• Daniel Lokshtanov, University of California, San Diego, USA
• Dániel Marx, Humboldt-Universität zu Berlin, Germany
• Ramanujan Maadapuzhi Sridharan, The Institute of Mathematical Sciences, India
• Pierre Marquis, Université d’Artois & CRIL-CNRS, France
• Jesper Nederlof, University of Bergen, Norway
• Rolf Niedermeier, TU Berlin, Germany
• Christophe Paul, CNRS – LIRMM (Montpellier), France
• Marcin Pilipczuk, University of Warsaw, Poland
• Michał Pilipczuk, University of Warsaw, Poland
• Arash Rafiey, IDSIA, Switzerland
• Venkatesh Raman, Institute of Mathematical Sciences, Chennai, India
• Frances A. Rosamond, Charles Darwin University, Australia
• Saket Saurabh, The Institute of Mathematical Sciences, India
• Martina Seidl, Johannes Kepler Universität Linz, Austria
• Hadas Shachnai, Technion, Israel
• Narges Simjour, University of Waterloo, Canada
• Karolina Soltys, Max Planck Institute, Germany
• Ondra Suchy, Saarland University, Saarbrucken, Germany
• Jan Arne Telle, University of Bergen, Norway
• Dimitrios Thilikos, National and Kapodistrian University of Athens, Greece
• Erik Jan van Leeuwen, University of Bergen, Norway
• Angelina Vidali, University of Vienna, Austria
• Yngve Villanger, University of Bergen, Norway
• Magnus Wahlström, Max Planck Institute for Informatics, Germany
• Mathias Weller, TU Berlin, Germany
• Anders Yeo, Royal Holloway, University of London, UK