Michaël Rusinowitch (LORIA-INRIA-Lorraine)
For further informations please send
an e-mail to email@example.com
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
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
Topics of interest for ADDCT include (but are not restricted to):
The goal of ADDCT is to bring together researchers interested in exploring
the topics above, both at a theoretical level and motivated by applications.
Submission and selection procedure:
We plan to accept three types of papers:
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 http://www.easychair.org/ADDCT2007/
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.
A special issue of the Journal of Symbolic Computation on the topic of
the ADDCT workshop is planned.
| Silvio Ghilardi
|| Viorica Sofronie-Stokkermans
| Università degli Studi di Milano
|| Max-Planck-Institut für Informatik, Saarbrücken
| Ulrike Sattler
|| Ashish Tiwari
| University of Manchester
|| Stanford Research International