Call for Papers
Submission Deadline: 23 Feb 2009
Please refer to Important Dates for other deadline dates.
CADE is the major forum for the presentation of research in all aspects of automated deduction. The conference programme will include invited talks, paper presentations, system descriptions, workshops, tutorials, and system competitions.
We invite high-quality submissions on the general topic of automated deduction, including foundations, applications, implementations and practical experiences.
- Logics of interest include, but are not limited to
- propositional, first-order, equational, higher-order, classical, description, modal, temporal, many-valued, intuitionistic, other non-classical, meta-logics, logical frameworks, type theory and set theory.
- Methods of interest include, but are not limited to
- saturation, resolution, tableaux, sequent calculi, natural deduction, term rewriting, decision procedures, model generation, model checking, constraint solving, induction, unification, proof planning, proof checking, proof presentation and explanation.
- Applications of interest include, but are not limited to
- program analysis and verification, hardware verification, mathematics, natural language processing, computational linguistics, knowledge representation, ontology reasoning, deductive databases, functional and logic programming, robotics, planning, and other areas of AI.
- Konstantin Korovin, The University of Manchester
- Martin Rinard, Massachusetts Institute of Technology
- Mark Stickel, SRI International
Workshops, Tutorials, System Competition
There will be a two-day programme of eight workshops and four tutorials before the conference. In addition, two system competitions will be held during the conference.
- Automated Deduction: Decidability, Complexity, Tractability (ADDCT)
- Beyond SAT: What About First-Order Logic?
- Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP)
- Modules and Libraries for Proof Assistants (MLPA)
- Proof Search in Type Theories (PSTT)
- Satisfiability Modulo Theories (SMT)
- The International Workshop on Unification (UNIF)
- TPTP World Workshop (TPTPWoWo)
- Hierarchical and Modular Reasoning in Complex Theories
- Probabilistic Analysis Using a Theorem Prover
- Precise, Automated and Scalable Verification of Systems Software Using SMT solvers
- Logics with Undefinedness
- System competitions:
- The CADE ATP System Competition (CASC)
- Satisfiability Modulo Theories Competition (SMT-COMP)
Details will be published shortly.
Travel awards will be available to enable selected students to attend the conference. Details here.
The proceedings of the conference will be published in the Springer LNAI/LNCS series.
Submissions can be made in the categories 'regular papers' and 'system descriptions'. The page limit in Springer LNCS style is 15 pages for regular papers and 5 pages for system descriptions. Full system descriptions that provide in-depth presentation of original ideas in an implemented system can be submitted as regular papers. For the benefit of reviewers, additional material may be provided by a clearly marked appendix or a reference to a manuscript on a website. It is at the discretion of the reviewers whether such supplements will be considered. All regular papers will be evaluated according to the highest standards in terms of originality, significance, technical quality, and readability.
Submissions must be in English and standard conforming pdf format. Submissions must be unpublished and not submitted for publication elsewhere. Authors are strongly encouraged to produce their papers in LaTeX.
Formatting instructions and the LNCS style files can be obtained via http://www.springer.de/comp/lncs/authors.html.
To submit your paper please use the EasyChair submission system at this address: http://www.easychair.org/conferences/?conf=cade22.
A paper title and a short abstract of about 100 words must be submitted before the paper. Please refer to Important Dates for submission deadlines.