CiAD 2002

2nd International Workshop on Complexity In Automated Deduction
Copenhagen, Denmark, July 25-26, 2002
Affiliated with CADE-18


Workshop web page

The main CiAD web page is at http://www.loria.fr/~hermann/workshop2002eng.html.

Aim of the workshop

The Workshop on Complexity in Automated Deduction will bring together researchers who work on or have a serious interest in problems that are in the interface between automated deduction and computational complexity. The aim of the workshop is to enhance the interaction between automated deduction and computational complexity through invited and contributed talks that will present comprehensive overviews, report on state-of-the art advances, and expand the horizons of this area of research.

Invited speakers

  • Achim Blumensath and Erich Gršdel, Aachen U of Techn., Germany
    Finite presentations of infinite structures: Automata and interpretation
  • Marco Cadoli, U Rome I (La Sapienza), Italy
    The expressive power of binary linear programming
  • Hubert Comon, ENS Cachan, France
    How difficult is it to retrieve a secret?
  • Martin Grohe, U Edinburgh, UK
    On the complexity of constraint satisfaction problems
  • Phokion G. Kolaitis, U California-Santa Cruz, USA
    On the complexity of model checking and inference in minimal models
  • Paliath Narendran, State U of New York-Albany, USA
    Unification problems with homomorphisms: decidability and complexity results
  • Reinhard Pichler, Vienna U of Techn., Austria
    Algorithms and complexity of model representations
  • Andrei Voronkov, U Manchester, UK
    The Knuth-Bendix orderings

Organizers

† † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † †