[DL] ARCADE 2019 CFP
geoff at cs.miami.edu
geoff at cs.miami.edu
Thu Apr 18 18:03:37 CEST 2019
*** CALL FOR PAPERS ***
Challenges, Applications, Directions, Exemplary achievements
25 or 26 August 2019, Natal, Brazil (co-located with CADE-27)
The main goal of this workshop is to bring together key people
from various subcommunities of automated reasoning---such as
SAT/SMT, resolution, tableaux, theory-specific calculi (e.g. for
description logic, arithmetic, set theory), interactive theorem
proving---to discuss the present, past, and future of the field.
The intention is to provide an opportunity to discuss broad
issues facing the community.
The structure of the workshop will be informal. We invite
extended abstracts (2-4 pages, using the EasyChair class style
http://www.easychair.org/publications/for_authors) in the form
of non-technical position statements aimed at prompting lively
discussion. The title of the workshop is indicative of the kind
of discussions we would like to encourage:
Challenges: What are the next grand challenges for research on
automated reasoning? Thereby, we refer to problems, solving
which would imply a significant impact (e.g., shift of focus) on
the CADE community and beyond.
Applications: Where is automated reasoning applicable in real-world
(industrial) scenarios? Which directions should be pursued to open
new application domains?
Directions: Based on the grand challenges and requirements from
real-world applications, what are the research directions the
community should promote? What bridges between the different
subcommunities of automated reasoning need to be strengthened?
What new communities should be included (if at all)?
Exemplary achievements: What are the landmark achievements of
automated reasoning whose influence reached far beyond the CADE
community itself? What can we learn from those successes when
shaping our future research?
Input from our community raised exciting questions like the following:
- What is the role of automated reasoning in AI, and vice versa?
- How can AR help to obtain explainable AI?
- What can full first-order logic as opposed to SAT/SMT do for
- How to identify relevant facts from large knowledge bases?
- How can provers exploit semantic knowledge?
- How can we ensure reliability of formal verification tools?
- How can we attract young people to our field?
in addition to many other intriguing issues
(see http://arcade2019.net/#topics for an extensive collection).
But we are most interested in your take on the upcoming challenges!
At the event, contributions will be grouped into similar themes and
authors will be invited to make their case within discussion panels.
After the workshop, they will be welcome to extend their abstracts
for inclusion in an EPiC post-proceedings, taking into account the
Submissions are to be made via the following EasyChair link:
IMPORTANT DATES (Anywhere on Earth):
Submission deadline: 2 June 2019
Notification: 30 June 2019
Workshop: 26 August 2019
Post-proceedings deadline: 29 September 2019
Franz Baader, TU Dresden
Christoph Benzmueller, Freie Universitaet Berlin
Armin Biere, Johannes Kepler University Linz
Nikolaj Bjorner, Microsoft Research
Jasmin Christian Blanchette, Inria Nancy & LORIA
Maria Paola Bonacina, Universite degli Studi di Verona
Pascal Fontaine, LORIA, Inria, University of Lorraine
Silvio Ghilardi, Universite degli Studi di Milano
Jurgen Giesl, RWTH Aachen
Alberto Griggio, FBK-IRST
Reiner Hahnle,TU Darmstadt
Marijn Heule, The University of Texas at Austin
Cezary Kaliszyk, University of Innsbruck
Laura Kovacs, Vienna University of Technology
Aart Middeldorp, University of Innsbruck
Neil Murray, SUNY at Albany
David Plaisted, University of North Carolina at Chapel Hill
Andrei Popescu, Middlesex University London
Renate Schmidt, The University of Manchester
Stephan Schulz, DHBW Stuttgart
Martin Suda, Czech Technical University (co-chair)
Geoff Sutcliffe, University of Miami
Josef Urban, Czech Technical University
Christoph Weidenbach, Max Planck Institute for Informatics
Sarah Winkler, University of Innsbruck (co-chair)
More information about the dl