[Caml-list] CADE-27: Second Call for Papers

The 27th International Conference on Automated Deduction (CADE-27)
Natal, Brazil
25-30 August 2019
http://www.cade-27.info

CALL FOR PAPERS

CADE is the major international forum for presenting research on all aspects
of automated deduction. High-quality submissions on the general topic of
automated deduction, including foundations, applications, implementations,
theoretical results, practical experiences and user studies are solicited.

Key dates:
Abstract deadline (extended): 20 February 2019
Submission deadline (extended): 27 February 2019

* Logics of interest include propositional, first-order, equational,
higher-order, classical, description, modal, temporal, many-valued,
constructive, other non-classical, meta-logics, logical frameworks, type
theory, set theory, as well as any combination thereof.

* Paradigms of interest include theorem proving, model building, constraint
solving, computer algebra, model checking, proof checking, and their
integration.

* Methods of interest include resolution, superposition, completion,
saturation, term rewriting, decision procedures, model elimination,
connection methods, tableaux, sequent calculi, natural deduction, as
well as their supporting algorithms and data structures, including
matching, unification, orderings, induction, indexing techniques, proof
presentation and explanation, proof planning.

* Applications of interest include program analysis, verification and
synthesis of software and hardware, formal methods, computational logic,
computer mathematics, natural language processing, computational
linguistics, knowledge representation, ontology reasoning, deductive
databases, declarative programming, robotics, planning, and other areas
of artificial intelligence.

Submissions can be made in two categories: regular papers and system
descriptions. The page limit in Springer LNCS style is 15 pages excluding
references for regular papers and 10 pages excluding references for system
descriptions. Submissions must be unpublished and not submitted for
publication elsewhere. They will be judged on relevance, originality,
significance, correctness, and readability. System descriptions must
contain a link to a working system and will also be judged on usefulness
and design. Proofs of theoretical results that do not fit in the page limit,
executables of systems, and input data of experiments should be made
available, via a reference to a website or in an appendix of the paper.
For papers containing experimental evaluations, all data needed to rerun
the experiments must be available. Reviewers will be encouraged to consider
this additional material, but submissions must be self-contained within the
respective page limit; considering the additional material should not be
necessary to assess the merits of a submission. The review process will
include a feedback/rebuttal period where authors will have the option to
respond to reviewer comments. The PC chair may solicit further reviews after
the rebuttal period.

The proceedings of the conference will be published in the Springer LNCS/LNAI
series. Formatting instructions and the LNCS style files can be obtained at

http://www.springer.de/comp/lncs/authors.html

At every CADE conference the Program Committee selects one of the accepted
papers to receive the CADE Best Paper Award. The award recognizes a paper
that the Program Committee collegially evaluates as the best in terms of
originality and significance, having substantial confidence in its correctness.
Overall technical quality, completeness, scholarly accuracy, and readability
are also considered. Characteristics associated with a best paper include,
for instance, introduction of a strong new technique or approach, solution
of a long-standing open problem, introduction and solution of an interesting
and important new problem, highly innovative application of known ideas or
existing techniques, and presentation of a new system of outstanding power.
Under exceptional circumstances, the Program Committee may give two awards
(ex aequo) or give no award.

IMPORTANT DATES
Abstract deadline: 20 February 2019
Submission deadline: 27 February 2019
Rebuttal phase: 2 April 2019
Notification: 15 April 2019
Final version: 27 May 2019

SUBMISSION INSTRUCTIONS

Papers should be submitted via

https://easychair.org/conferences/?conf=cade27

CADE-27 ASSOCIATED EVENTS

Automated Reasoning: Challenges, Applications, Directions, Exemplary
Achievements (ARCADE), http://cl-informatik.uibk.ac.at/users/swinkler/arcade/
The CADE ATP System Competition, http://www.tptp.org/CASC/27/
Deduction Mentoring Workshop
Logical and Semantic Frameworks, with Applications (LSFA),
https://sites.google.com/view/lsfa2019
Proof eXchange for Theorem Proving (PxTP), http://pxtp.gforge.inria.fr/2019/
Theorem Prover Components for Educational Software (ThEdu'19),
http://www.uc.pt/en/congressos/thedu/thedu19
The 6th Vampire Workshop

CADE-27 ORGANIZERS

Conference Chair:
Elaine Pimentel Federal University of Rio Grande do Norte, Brazil

Organizers:
Carlos Olarte Federal University of Rio Grande do Norte, Brazil
Joao Marcos Federal University of Rio Grande do Norte, Brazil
Claudia Nalon University of Brasilia, Brazil
Giselle Reis CMU, Qatar

Program Committee Chair:
Pascal Fontaine Universite de Lorraine, CNRS, Inria, LORIA, France

Workshop, Tutorial, and Competition Chair:
Giles Reger University of Manchester, UK

Publicity Chair:
Geoff Sutcliffe University of Miami, USA

Program Committee:
Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina
Franz Baader, TU Dresden, Germany
Clark Barrett, Stanford University, USA
Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands
Maria Paola Bonacina, Universita degli Studi di Verona, Italy
Leonardo Mendonca de Moura, Microsoft Research, USA
Hans de Nivelle, Nazarbayev University, Astana, Kazakhstan
Clare Dixon, University of Liverpool, UK
Mnacho Echenim, Universite de Grenoble, France
Marcelo Finger, University of Sao Paulo, Brazil
Pascal Fontaine, Universite de Lorraine, CNRS, Inria, LORIA, France
Silvio Ghilardi, Universita degli Studi di Milano, Italy
Juergen Giesl, RWTH Aachen University, Germany
Rajeev Gore, The Australian National University, Australia
Stefan Hetzl, Technische Universitaet Wien, Austria
Marijn J. H. Heule, The University of Texas at Austin, USA
Nao Hirokawa, JAIST, Japan
Moa Johansson, Chalmers University of Technology, Sweden
Cezary Kaliszyk, University of Innsbruck, Austria
Deepak Kapur, University of New Mexico, USA
Benjamin Kiesl, Technische Universitaet Wien, Austria
Konstantin Korovin, The University of Manchester, UK
Laura Kovacs, Technische Universitaet Wien, Austria
Ramana Kumar, DeepMind, UK
Claudia Nalon, University of Brasilia, Brazil
Vivek Nigam, Federal University of Paraiba & Fortiss, Brazil & Germany
Carlos Olarte, Federal University of Rio Grande do Norte, Brazil
Jens Otten, University of Oslo, Norway
Andre Platzer, Carnegie Mellon University, USA
Andrew Reynolds, The University of Iowa, USA
Philipp Ruemmer, Uppsala University, Sweden
Renate A. Schmidt, The University of Manchester, UK
Stephan Schulz, DHBW Stuttgart, Germany
Roberto Sebastiani, University of Trento, Italy
Natarajan Shankar, SRI International, USA
Viorica Sofronie-Stokkermans, Universitaet Koblenz-Landau, Germany
Martin Suda, Czech Technical University, Czech Republic
Geoff Sutcliffe, University of Miami, USA
Rene Thiemann, University of Innsbruck, Austria
Uwe Waldmann, Max Planck Institute for Informatics, Germany
Christoph Weidenbach, Max Planck Institute for Informatics, Germany
Sarah Winkler, University of Innsbruck, Austria