===================================================================
                      CALL FOR PAPERS
  Automated Deduction: Decidability, Complexity, Tractability
                     (ADDCT 2013)

Workshop affiliated with IJCAR 2014 and RTA 2014, 
Vienna Summer of Logic 2014, Vienna. 
         http://www.uni-koblenz.de/~sofronie/addct-2014/
===================================================================
Important Dates
   8 April  2014: Paper submission (extended)
   30 April 2014: Notification
   10 May   2014: Final version
   18 July  2014: Workshop
===================================================================
          
Decidability, and especially complexity and tractability of logical 
theories is extremely important for a large number of applications. 
Although predicate logic and number theory are undecidable, decidable 
theories or decidable theory fragments 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 to 
design efficient decision procedures for them. It is equally important 
to have uniform methods (e.g. resolution, rewriting, tableaux, sequent 
calculi) which can be tuned to provide algorithms with optimal complexity.

GOAL
====
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 OF INTEREST
==================
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. 


SUBMISSION AND SELECTION PROCEDURE
==================================
Submissions are encouraged in one of the following categories: 

- 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: may describe work previously published, 
  and 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 at  
http://www.easychair.org/conferences/?conf=addct2014

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


PROGRAM COMMITTEE
=================
TBA

For further informations please send an e-mail to 
Viorica Sofronie-Stokkermans (sofronie@uni-koblenz.de)