Finite and Algorithmic Model Theory 2012
Scientific Program
 Monday
 9.15  10.15 Anuj Dawar: Finite Model Theory and Linear Algebra. Slides
 11.00  12.00
 Wied Pakusa: Definability of linear equation systems
over groups and rings. Slides
 Eryk Kopczinski: Bounded degree and planar spectra. Slides
 14.00  15.30
 Sebastian Siebertz: Modelchecking on ordered structures. Slides
 Wojtek Kazana: Firstorder logic over classes of graphs
with bounded expansion. Slides
 Michael Elberfeld: Solving MSOdefinable problems on
structures of bounded treewidth. Slides
 16.00  17.30
 Jouko Väänänen: Dependence and Independence. Slides
 Steven Lindell: Infinitary methods in finite model theory. Slides
 Jan Van Den Bussche: Expressiveness within the calculus of
relations extended with transitive closure.Slides
 Tuesday
 9:00  10:00 Benoît Larose: Constraint satisfaction problems and Algebra. Slides
 10:30  12:00

Christoph Berkholz: Lower bounds for the resolution width problem and existential games. Slides
 Lauri Hella: Modal logic and weak models of distributed computation
 Pietro Galliani: Database updates and dynamic logics of imperfect information
 14:00  15:30

Moshe Vardi: Phase transition and computational complexity. Slides
 Mikolaj Bojanczyk: Computation in FraenkelMostowski sets. Slides
 16:00  17:30
 Faried Abu Zaid: Structural properties of omegaautomatic structures
 Sasha Rubin: automatic structures
 Thomas Colcombet: New limitedness and boundedness problems. Slides
 Wednesday
 9:00  10:00 Martin Grohe: Definable structure theory. Slides
 10:30  12:00
 Albert Atserias: Indistinguishability in counting logics and linear programming relaxations. Slides
 Pablo Barcelo: Efficient approximations of conjunctive queries. Slides
 Diego Figueira: Graph logics with rational relations and the generalized intersection problem
 14:00  15:30
 Arnaud Durand: When is counting for conjunctive queries tractable?
 Achim Blumensath: Recognisability for Infinite trees. Slides
 Lukasz Kaiser: Learning and playing board games from the FMT perspective. Slides
 16:00  18:00 OPEN PROBLEM SESSION
 Thursday
 9:00  10:00 Martin Otto: finite models for guarded logics. Slides
 10:30  12:00
 Balder ten Cate: Guarded negation. Slides
 Georg Gottlob: Datalog+. Slides
 Jerzy Marcinkowski: On the finite controllability of queries for some sets of TGDs. Slides
 Friday
 9:00  10:00 Oleg Verbitsky: Firstorder complexity of individuals graphs: results and questions. Slides
 10:30  12:00
 Dietrich Kuske: an optimal construction of Hanf sentences. Slides
 Charles Jordan: experimental descriptive complexity. Slides
 Gaelle Fontaine: A link between inconsistent databases and CSP. Slides
 Bonus track
Janos Makowsky: Connection Matrices
and Definability of Graph Invariants. Slides