Automated Deduction: Decidability, Complexity, Tractability


Affiliated with CADE-22 McGill University, Montreal, Canada August 2 - 7, 2009



Call for papers

Important dates

  • Submission: May 25, 2009
  • Notification: June 15, 2009
  • Final versions: July 1, 2009
  • Workshop: August 2, 2009

Submission procedure


Invited speakers
  • Catherine Meadows
    (joint with UNIF)
  • Program

    ADDCT'09 proceedings



  • Franz Baader (TU Dresden)
  • Silvio Ghilardi (U. Milano)
  • Miki Hermann (Ecole Polytechnique, Palaiseau)
  • Viorica Sofronie-Stokkermans (MPI,Saarbrücken)
  • Ashish Tiwari (Menlo Park)
  • Program Committee

  • Carlos Areces (INRIA Nancy)
  • Franz Baader (TU Dresden)
  • Peter Baumgartner(NICTA, Canberra)
  • Maria Paola Bonacina (U. Verona)
  • Christian Fermüller (T.U.Wien)
  • Silvio Ghilardi (U. Milano)
  • Miki Hermann (Ecole Polytechnique, Palaiseau)
  • Ullrich Hustadt (U. Liverpool)
  • Sava Krstic (Intel Corporation)
  • Christopher Lynch (Clarkson U.)
  • Silvio Ranise (LORIA/INRIA-Lorraine and U. Verona)
  • Viorica Sofronie-Stokkermans (MPI,Saarbrücken)
  • Lidia Tendera (U. Opole)
  • Dmitry Tishkovsky (U. Manchester)
  • Ashish Tiwari (SRI)
  • Luca Vigano (U. Verona)

  • Contact

    For further informations please send an e-mail to

    Decidability, and especially complexity and tractability of logical theories is extremely important for a large number of applications. Although general logical formalisms (such as predicate logic or number theory) are undecidable, decidable theories or decidable fragments thereof (sometimes even with low complexity) often occur in mathematics, in program verification, in the verification of reactive, real time or hybrid systems, as well as in databases and ontologies. It is therefore important to identify such decidable fragments and design efficient decision procedures for them. It is equally important to have uniform methods (such as resolution, rewriting, tableaux, sequent calculi, ...) which can be tuned to provide algorithms with optimal complexity.

    The goal of ADDCT is to bring together researchers interested in

  • identifying (fragments of) logical theories which are decidable, identifying fragments thereof which have low complexity, and analyzing possibilities of obtaining optimal complexity results with uniform tools;
  • analyzing decidability in combinations of theories and possibilities of combining decision procedures;
  • efficient implementations for decidable fragments;
  • application domains where decidability resp. tractability are crucial.

  • Topics

    Topics of interest for ADDCT include (but are not restricted to):
  • Decidability:
  • decision procedures based on logical calculi such as:
    resolution, rewriting, tableaux, sequent calculi, or natural deduction
  • decidability in combinations of logical theories
  • Complexity:
  • complexity analysis for fragments of first- (or higher) order logic
  • complexity analysis for combinations of logical theories
    (including parameterized complexity results)
  • Tractability (in logic, automated reasoning, algebra, ...)

  • Application domains for which complexity issues are essential
    (verification, security, databases, ontologies, ...)
  • The goal of ADDCT is to bring together researchers interested in exploring the topics above, both at a theoretical level and motivated by applications.

    Important dates

  • Full Paper submission: May 25, 2009
  • Notification: June 15, 2009
  • Final versions: July 1, 2009
  • Workshop: August 2, 2009

  • Submission and selection procedure:

    We plan to accept three types of papers:
  • Original papers (up to 15 pages, LNCS style, including bibliography); should describe original research and contain sufficient detail to assess the merits and relevance of the contribution. Simultaneous submission of material is prohibited.

  • Work in progress (up to 6 pages, LNCS style, without bibliography).

  • Presentation-only papers (please submit an abstract of up to 3 pages, LNCS style + a link to the already published paper): may describe work previously published. The abstracts of accepted presentation-only papers will appear in the informal proceedings to be distributed at the workshop (full papers in this category will not be inserted in the proceedings).
    We are allowing the submission of previously published work in order to allow researchers to communicate good ideas that the attendees may not be aware of.

  • Given the informal style of the workshop, the submission of papers presenting student's work and work in progress is encouraged. Submission of papers is via Easychair


    The final versions of the selected contributions will be collected in a volume to be distributed at the workshop. These informal proceedings will also be made accessible on the web.

    We plan to publish selected papers in ENTCS or in a special journal issue on the topic of the ADDCT workshop after an extra refereeing round.