Fontainebleau Campus of Université Paris 12, France
10:00-11:00 Yury Matiyasevich presence confirmed, talk not confirmed
11:00-11:30 Coffee/tea break
11:30-12:00 Alexandre Rambaud Title to be communicated
12:00-12:30 Olivier Finkel Infinite computations and highly undecidable problems
12:30-14:30 Lunch break on location
14:30-15:30 Bruno Courcelles On Seese's Conjecture
15:30-16:00 Thomas Brihaye Model-Checking, bisimulation and word combinatorics
16:00-16:30 Coffee/tea break
16:30-17:00 Serge Grigorieff Infinite computations and Kolmogorov complexities
17:00-17:30 Emil Jerabek Hardness amplification in bounded arithmetic
17:30-18:00 Daniel Graça Computing with continuous-time analog circuits
10:00-11:00 Joachim Niehren Querying XML trees by tree automata
11:00-11:30 Coffee/tea break
11:30-12:00 Olivier Teytaud Inductive-deductive systems : a statistical learning point of view
12:00-12:30 Andres Cordon On axiom schemes for D(n+1)(T)-formulas
12:30-14:30 Lunch break on location
14:30-15:30 Anca Muscholl Logic with data
15:30-16:00 Luc Ségoufin Title to be communicated
16:00-16:30 Coffee/tea break
16:30-17:30 Janos Makowsky Application of Logic in Combinatorics
17h30-18:00 Jerzy Tomasik Synthesis Theories of Finite Structures of Arithmetics
19:30 Special Dinner
9:30-10:30 Victor Selivanov Some Hierarchies and Reducibilities on Regular Languages
10:30-11:00 Coffee/tea break
11:00-11h30 Romain Péchoux Resource analysis by sup-interpretation
11:30-12:00 Paulin De Naurois The Complexity of Semilinear Problems in Succinct Representation
12:00-12:30 Miki Hermann Complexité des contraintes de patterns sur les domaines totalement ordonnés
12:30-13h30 Final lunch on location
Last modified: May 16, 2005