General questions about organization, registration, accomodation, etc., should be sent to
Program-related questions should be directed to program committee chairs.
Helmut Schwichtenberg will be turning emeritus in September 2010. These two workshops will be held to honour his many important contributions to the fields of both.
This workshop will focus on recent developments in Applied Proof Theory, in particular Program Extraction from Proofs, and Constructive Mathematics. The two areas have a substantial common interest, namely the exploration of the computational content of constructive mathematical and logical principles. It is the aim of this workshop to bring active researchers from both fields together and exchange ideas.
This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include: version of lambda calculi adapted to represent classical logic; design of programming languages inspired by classical logic; cut-elimination for classical systems; proof representation and proof search for classical logic; translations of classical to intuitionistic proofs; constructive interpretation of non-constructive principles; witness extraction from classical proofs; constructive semantics for classical logic, e.g. game semantics; case studies.
The aim of this workshop is to discuss recent theoretical results and experiments related to randomized and quantum algorithms. Topics of interest include, but are not limited to: random walk, quantum walk, probabilistic and quantum finite automata, quantum automata with mixed states, description of probabilistic and quantum finite automata by means of second order logics.
Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop).
The aim of the event is to provide a forum for doctoral students and other young researchers to present and discuss their recently published/submitted results or ongoing work in the field of theoretical computer science (in a broad sense). Senior researchers are warmly welcome to auditorium and discussions.
The purpose of this workshop is to bring together researchers interested in the algorithmic aspects of graph crossing number problems. During the last ten years or so, we have witnessed a growing interest in complexity and algorithmic issues around crossing numbers. On the complexity front, we have Grohe’s surprising result that CrossingNumber is fixed parameter tractable, followed up by the recent refinement by Kawarabayashi and Reed. On the more applied side, we have the algorithms implemented by Petra Mutzel and her research team that compute the exact crossing number of relatively large graphs. Then there is a recent series of specialized constant-factor approximation algorithms for the crossing number by Hlineny, Salazar, and Chimani. Yet another really surprising, exciting result is Cabello and Mohar’s proof that CrossingNumber is still NP-hard for nearly-planar graphs (that is, graphs with an edge whose removal leaves a planar graph).
We see this workshop as an opportunity to reflect on these developments, with an emphasis on the interplay between the theoretical and the algorithmical aspects of graph crossing numbers.
This symposium is being held in honor of Yuri Gurevich’s seventieth birthday. Gurevich’s interests have spanned a broad spectrum of logic and computer science, including decision procedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. Many of these will be reflected in the topics of the day.
A liber amicorum is being planned.
Reachability Problems is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in algebraic structures, computational models, hybrid systems, and verification.
Topics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.
Formal methods are widely used in development and analysis of complex systems such as aircraft flight control systems, controllers of industrial processes, biological processes etc. These systems usually exhibit features such as randomness, interaction and parallelism. Probabilistic and game theoretic models are especially well suited for capturing these features and therefore there is a need to develop such models and methods for their analysis. The goal of this workshop is to bring together researchers with interest in probabilistic and game theoretic methods in formal verification.
Mathematical fuzzy logic is a sub-discipline of mathematical logic studying the notion of comparative truth. We encourage high quality submissions in all areas of mathematical fuzzy logic, including algebraic Semantics, proof systems, game theory, first and higher order fuzzy logics, and applications.
The aim of the workshop is to bring together researchers with a common interest in categorical logic and its applications.
This workshop focuses on topics concerning Combinatorics and Logic, and the associated computational aspects. It follows the tradition of previous meetings in Barcelona 2002, Roma 2004, and Szeged 2006. All lectures will be on invitation. They can be surveys or presentations of technical results. Some typical topics of the workshop include (not exclusively): Logical expression of graph properties, graph decompositions, graph transformations and related notions. Logical expression of properties of matroids, isotropic systems, graph drawings and knots. Counting and enumeration problems. Polynomials associated with graphs and other combinatorial structures. Combinatorics in games, 0/1 laws and randomized computations. Constraint satisfaction problems and other logically based algorithmic problems. Finite descriptions of infinite structures. Proof complexity.
This workshop aims to support a fruitful exchange of ideas between the research on Parameterized Complexity on one side and the research on various forms of computational reasoning (such as Nonmonotonic, Probabilistic, and Constraint-based reasoning) on the other. Topics of interest include but are not limited to: multivariate analysis of reasoning problems, kernelization and preprocessing, fixed-parameter tractability and hardness, backdoors and decompositions.