16 Jul 2021
*** CALL FOR PAPERS ***
ARCADE http://arcade2021.net/
Automated Reasoning: Challenges, Applications, Directions,
Exemplary achievements
16 July 2021, virtual online (co-organized along with CADE-28)
What are the current challenges, applications, directions, or exemplary
achievements of Automated Reasoning? Input from our community raised
exciting topics including the following:
- Automated reasoning and AI: The increasing power and success of AI is widely
recognized, but while AI and ML are closely associated, it is less clear what
is the role of AR in AI.
- Automated reasoning and program synthesis: AR has been more influential for
program verification than for synthesis: where do we stand with respect to
the latter, and how can we improve?
- Automated reasoning and quantum computing: what do we know about that? Will
AR benefit from QC, or vice versa?
- Automated reasoning and XAI: how can AR help to obtain explainable AI?
- Automated reasoning and usability: How to make AR more accessible and easy
to use by the general computer science community?
- Full first-order vs SAT/SMT: What can full first-order logic as opposed to
SAT/SMT offer to verification?
- Tool evaluation: Can we improve evaluation methods for automated reasoning
tools? The field of ML is strict about separate training and test sets: what
can we learn from that?
- Learning from proof attempts: Taking up on current trends of AI, how can
"relevant" lemmas from proof attempts be extracted?
- Verified automated reasoning: Recently there have been many efforts in
formally verifying calculi and AR tools, but the learning curve for newcomers
is still very steep. What can we do about that?
We are most interested in your take on these and other upcoming challenges for
automated reasoning!
DESCRIPTION:
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?
WORKSHOP FORMAT:
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
post-proceedings (EPiC or similar), taking into account the discussion.
Submissions are to be made via the following EasyChair link:
https://easychair.org/conferences/?conf=arcade2021
IMPORTANT DATES:
Submission deadline: 30 May 2021 (Anywhere on Earth)
Notification: 27 June 2021
Workshop: 16 July 2021
Post-proceedings deadline: TBA August 2021
PROGRAM COMMITTEE:
Franz Baader, TU Dresden, Germany
Alexander Bentkamp, Universitae4t des Saarlandes, Germany
Christoph BenzmueBCller, Freie Universitaet Berlin, Germany
Armin Biere, Johannes Kepler University Linz, Austria
Nikolaj Bjorner, Microsoft Research, USA
Maria Paola Bonacina, Universita degli Studi di Verona, Italy
Pascal Fontaine, Universite de Liege, Belgium
Silvio Ghilardi, Universita degli Studi di Milano, Italy
Juergen Giesl, RWTH Aachen University, Germany
Marijn Heule, Carnegie Mellon University, USA
Reiner Haehnle, TU Darmstadt, Germany
Cezary Kaliszyk, University of Innsbruck, Austria
Laura Kovacs, Vienna University of Technology, Austria
Aart Middeldorp, University of Innsbruck, Austria
Stefan Mitsch, Carnegie Mellon University, USA
Neil Murray, ILS Institute, University at Albany - SUNY, USA
David Plaisted, The University of North Carolina at Chapel Hill, USA
Andrei Popescu, Middlesex University London, UK
Andrew Reynolds, University of Iowa, USA
Philipp Ruemmer, Uppsala University, Sweden
Renate A. Schmidt, The University of Manchester, UK
Stephan Schulz, DHBW Stuttgart, Germany
Martin Suda, Czech Technical University in Prague, Czechia (co-chair)
Geoff Sutcliffe, University of Miami, USA
Josef Urban, Czech Technical University in Prague, Czechia
Christoph Weidenbach, Max Planck Institute for Informatics, Germany
Sarah Winkler, Free University of Bozen-Bolzano, Italy (co-chair)
--
[LOGIC] mailing list
http://www.dvmlg.de/mailingliste.html
Archive: http://www.illc.uva.nl/LogicList/
provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam