CADE 2011

1 Feb 2011 23:59

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, instance-based, 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, 
synthesis, systematic software and hardware testing, 
(computer-aided) mathematics, natural language processing, 
computational linguistics, knowledge representation, ontology 
reasoning, deductive databases, functional and logic 
programming, robotics, planning and other areas of AI.