[FOM] CADE-23: Second Call for Papers

Carsten Schuermann carsten at itu.dk
Fri Dec 10 11:30:04 EST 2010

                    CALL FOR PAPERS

       23nd International Conference on Automated Deduction
                     Wroclaw, Poland
                  July 31- August 5, 2011

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:
     o 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
     o 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
     o program analysis and verification, hardware verification,
       systematic software and hardware testing, mathematics,
       natural language processing, computational
       linguistics, knowledge representation, ontology reasoning,
       deductive databases, functional and logic programming,
       robotics, planning, synthesis, and other areas of AI.

  * Koen Claessen, Chalmers University of Technology, Sweden
  * Byron Cook, Microsoft Research, Cambridge and Queen Mary, Univ. of London
  * Xavier Leroy, INRIA Paris-Rocquencourt, France
  * Aarne Ranta, University of Gothenburg, Sweden

Travel awards will be available to enable selected students to
attend the conference. Details will be published on the conference

The proceedings of the conference will be published by Springer
Verlag in the LNCS/LNAI series.

Submissions can be made in the categories
     o 'regular papers' and
     o 'short system descriptions'.

The page limit in Springer LNCS style is
     o 15 pages for regular papers and
     o 5 pages for short 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

To submit your paper please use the EasyChair submission system at

Submission Deadlines
     * Abstracts:   1 February 2011
     * Full Papers: 7 February 2011

Other Dates
     * Notification:  20 March 2011
     * Final Version: 20 April 2011
     * Workshops/Tutorials: 31 July-1 August 2011
     * Conference: 2-5 August 2011

  * Alessandro Armando, Università di Genova and FBK-irst, Italy
  * Franz Baader, Technische Universität Dresden, Germany
  * Peter Baumgartner, NICTA Canberra, Australia
  * Bernhard Beckert, Karlsruhe Institute of Technology, Germany
  * Nikolaj Bjørner, Microsoft Research, USA (PC co-chair)
  * Maria Paola Bonacina, Università degli Studi di Verona, Italy
  * Alessandro Cimatti, FBK-irst, Italy
  * Stephanie Delaune, CNRS, LSV, France
  * Bruno Dutertre, SRI International, USA
  * Ulrich Furbach, University of Koblenz, Germany
  * Silvio Ghilardi, Università degli Studi di Milano, Italy
  * Jürgen Giesl, RWTH Aachen, Germany
  * Rajeev Goré, The Australian National University, Australia
  * John Harrison, Intel Corporation, USA
  * Ullrich Hustadt, University of Liverpool, United Kingdom
  * Reiner Hähnle, Chalmers University of Technology, Sweden
  * Deepak Kapur, University of New Mexico, USA
  * Viktor Kuncak, EPFL, Switzerland
  * Alexander Leitsch, Technische Universität Wien, Austria
  * Christopher Lynch, Clarkson University, USA
  * Claude Marché, INRIA Saclay, France
  * Aart Middeldorp, Universität Innsbruck, Austria
  * Leonardo de Moura, Microsoft Research, USA
  * Tobias Nipkow, TU München, Germany
  * Hans de Nivelle, University of Wroclaw, Poland
  * Albert Oliveras, Universitat Politècnica de Catalunya, Spain
  * Lawrence Paulson, University of Cambridge, United Kindgom
  * Frank Pfenning, Carnegie Mellon University, USA
  * Brigitte Pientka, McGill University, Canada
  * David Plaisted, University of North Carolina-Chapel Hill, USA
  * Michael Rusinowitch, INRIA Nancy Grand Est, France
  * Renate A. Schmidt, The University of Manchester, United Kingdom
  * Carsten Schürmann, IT University of Copenhagen, Denmark
  * Roberto Sebastiani, DISI, University of Trento, Italy
  * Gert Smolka, Saarland University, Germany
  * Viorica Sofronie-Stokkermans, Max Planck Institute for Informatics,
    Saarbrücken, Germany (PC co-chair)
  * Aaron Stump, University of Iowa, USA
  * Geoff Sutcliffe, University of Miami, USA
  * Cesare Tinelli, The University of Iowa, USA
  * Andrei Voronkov, The University of Manchester, United Kingdom
  * Christoph Weidenbach, Max Planck Institute for Informatics,
    Saarbrücken, Germany
  * Frank Wolter, University of Liverpool, United Kingdom

  * Hans de Nivelle, University of Wroclaw, Poland

  * Nikolaj Bjørner, Microsoft Research, USA
  * Viorica Sofronie-Stokkermans, Max-Planck Institute for Informatics, Germany

  * Aaron Stump, University of Iowa, USA

  * Carsten Schürmann, IT University of Copenhagen, Denmark

  * Hans de Nivelle
  * Katarzyna Wodzynska

More information about the FOM mailing list