FLoC '02 - CiAD program

CiAD program

All sessions take place in auditorium 7.

Thursday's program is also available side by side with other meetings.

09:00-10:30 Session 1

09:00	Marco Cadoli, U Rome I (La Sapienza), Italy Invited talk: The expressive power of binary linear programming
10:00	Manfred Schmidt-Schauß, Frankfurt U, Germany and Jürgen Stuber, LORIA Nancy, France On the complexity of linear and stratified context matching problems

10:30-11:00 Refreshments

11:00-12:30 Session 2

11:00	Phokion G. Kolaitis, U California-Santa Cruz, USA Invited talk: On the complexity of model checking and inference in minimal models
12:00	Arnaud Durand, U Paris XII (Val-de-Marne), France and Miki Hermann, École Polytechnique, France The inference problem for propositional circumscription of affine formulas is coNP-complete

12:30-14:00 Lunch

14:00-15:30 Session 3

14:00	Discussion
14:30	Martin Grohe, U Edinburgh, UK Invited talk: On the complexity of constraint satisfaction problems

15:30-16:00 Refreshments

16:00-17:30 Session 4

16:00	Paliath Narendran, State U of New York-Albany, USA Invited talk: Unification problems with homomorphisms: decidability and complexity results
17:00	Discussion

Friday's program is also available side by side with other meetings.

09:00-10:30 Session 5

09:00	Achim Blumensath and Erich Grädel, Aachen U of Techn., Germany Invited talk: Finite presentations of infinite structures: Automata and interpretation
10:00	Dietmar Berwanger and Erich Grädel, Aachen U of Techn., Germany Fixed point formulae and solitaire games

10:30-11:00 Refreshments

11:00-12:30 Session 6

11:00	Reinhard Pichler, Vienna U of Techn., Austria Invited talk: Algorithms and complexity of model representations
12:00	Oswaldo Terán, Universidad de Los Andes, Venezuela and Bruce Edmonds, Manchester Metropolitan U, UK Computational complexity of a constraint model-based proof of the envelope of tendencies in a MAS-based simulation model

12:30-14:00 Lunch

14:00-15:30 Session 7

14:00	Discussion
14:30	Hubert Comon, ENS Cachan, France Invited talk: How difficult is it to retrieve a secret?

15:30-16:00 Refreshments

16:00-17:00 Session 8

16:00

Andrei Voronkov, U Manchester, UK
Invited talk: The Knuth-Bendix orderings