Automated Deduction: Decidability, Complexity, Tractability
18 July 2014
Affiliated with IJCAR 2014 and RTA 2014
Vienna Summer of Logic, 9-24 July 2014
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
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/conferences/?conf=addct2014
Publication:The final versions of the selected contributions will be collected in a volume to be distributed at the workshop. The volume will be 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.