31 Jul - 5 Aug 2011
Wroclaw, Poland
===================================================================
CALL FOR PAPERS
CADE-23
23nd International Conference on Automated Deduction
Wroclaw, Poland
July 31- August 5, 2011
http://cade23.ii.uni.wroc.pl/
===================================================================
GENERAL INFORMATION
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.
SCOPE
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,
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.
INVITED SPEAKERS:
TBA
WORKSHOPS, TUTORIALS, SYSTEM COMPETITIONS:
System competitions such as
The CADE ATP System Competition (CASC)
Details will be published in separate calls and on the
conference website.
STUDENT AWARDS
Travel awards will be available to enable selected students to
attend the conference. Details will be published on the
conference website.
PUBLICATION DETAILS:
The proceedings of the conference will be published in the
Springer LNCS/LNAI series.
SUBMISSION INSTRUCTIONS:
Submissions can be made in the categories
o 'regular papers' and
o 'system descriptions'.
The page limit in Springer LNCS style is
o 15 pages for regular papers and
o 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=cade2011
IMPORTANT DATES (tentative):
A paper title and a short abstract of about 100 words must be
submitted before the paper.
7 December 2010 Deadline for Workshop/Tutorial proposals
7 January 2011 Notification (Workshops/Tutorials)
1 February 2011 Abstract submission deadline
7 February 2011 Paper submission deadline
20 March 2011 Notification of paper decisions
20 April 2011 Camera-ready papers due
31 July-1 August 2011 Workshops & Tutorials
2-5 Aug 2011 Conference, including CASC
PROGRAM COMMITTEE
Alessandro Armando Universit di Genova
Franz Baader Technische Universitt Dresden
Peter Baumgartner NICTA Canberra
Nikolaj Bjorner Microsoft Research (PC co-chair)
Maria Paola Bonacina Universita` degli Studi di Verona
Bernhard Beckert Karlsruhe Institute of Technology
Alessandro Cimatti FBK-irst
Leonardo de Moura Microsoft Research
Stephanie Delaune CNRS, LSV
Bruno Dutertre SRI International
Ulrich Furbach University of Koblenz
Silvio Ghilardi Universit degli Studi di Milan
Jrgen Giesl RWTH Aachen
Rajeev Gore The Australian National University
John Harrison Intel Corporation
Ullrich Hustadt University of Liverpool
Reiner Hhnle Chalmers University of Technology
Deepak Kapur University of New Mexico
Viktor Kuncak EPFL
Alexander Leitsch Technische Universitt Wien
Christopher Lynch Clarkson University
Claude March INRIA Saclay, Parc Orsay Universit
Aart Middeldorp Universitt Innsbruck
Tobias Nipkow TU Munchen
Hans de Nivelle University of Wroclaw
Albert Oliveras Universitat Politcnica de Catalunya
Lawrence Paulson University of Cambridge
Frank Pfenning CMU
Brigitte Pientka McGill University
David Plaisted University of North Carolina-Chapel Hill
Michael Rusinowitch LORIA-INRIA-Lorraine
Renate A. Schmidt University of Manchester
Carsten Schuermann IT University of Copenhagen
Roberto Sebastiani DISI, University of Trento
Gert Smolka Universitt des Saarlandes
Viorica Sofronie-Stokkermans Max Planck Institute for Informatics (PC co-chair)
Aaron Stump University of Iowa
Geoff Sutcliffe University of Miami
Cesare Tinelli University of Iowa
Andrei Voronkov University of Manchester
Christoph Weidenbach Max Planck Institute for Informatics
Frank Wolter University of Liverpool
ORGANIZERS:
Conference Chair:
Hans de Nivelle University of Wroclaw
Workshop & Tutorial Chair:
Aaron Stump The University of Iowa
Publicity Chair:
Carsten Schrmann IT-Universitetet i Kbenhavn
PC Chairs:
Nikolaj Bjrner Microsoft Research
Viorica Sofronie-Stokkermans Max-Planck-Institut fr Informatik