Automated Deduction: Decidability, Complexity, Tractability(ADDCT 2013)
Affiliated with CADE-24 Lake Placid, New York
June 9 - 14, 2013
|
Home Topics Call for papers Important dates
Submission procedure Publication Invited speaker Program ADDCT'2013 proceedings Registration Organizers Program CommitteeContactFor further informations please send an e-mail tosofronie@uni-koblenz.de |
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
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 datesSubmission and selection procedure:We plan to accept three types of papers:
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.
Publication:The final versions of the selected contributions will be collected in a volume to be distributed at the workshop. The volume is available online here.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. | |