[DL] ADDCT'07: Deadline extension (Abstract Submission Deadline May 22)

Viorica Sofronie-Stokkermans sofronie at mpi-sb.mpg.de
Wed May 13 12:12:14 CEST 2009


 Automated Deduction: Decidability, Complexity, Tractability

Workshop affiliated with CADE-22 Montreal, Canada, 2 August 2009

For complete information- http://www.mpi-inf.mpg.de/~sofronie/addct09

Important Dates
  22 May    2009: Abstract submission   (* extended *)
  25 May    2009: Paper submission      (* extended *)
  15 June   2009: Notification
   1 July   2009: Final version
   2 August 2009: Workshop

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, 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, ...)

Submissions are encouraged in one of the following categories:

- Original papers (up to 15 pages, LNCS style, including bibliography);
- Work in progress (up to 6 pages, LNCS style, without bibliography).
- Presentation-only papers

Submission of papers is via EasyChair at

Organizers and Chairs
  Franz Baader (TU Dresden)
  Silvio Ghilardi (U. Milano)
  Miki Hermann (Ecole Polytechnique, Palaiseau)
  Viorica Sofronie-Stokkermans (MPI,Saarbruecken)
  Ashish Tiwari (SRI International)

For further informations please send an e-mail to
Viorica Sofronie-Stokkermans sofronie at mpi-inf.mpg.de

More information about the dl mailing list