10. – 15. September 2017, Dagstuhl Seminar 17371
Deduction Beyond First-Order Logic
Jasmin Christian Blanchette (VU University of Amsterdam, NL)
Carsten Fuhs (Birkbeck, University of London, GB)
Viorica Sofronie-Stokkermans (Universität Koblenz-Landau, DE)
Cesare Tinelli (University of Iowa – Iowa City, US)
Auskunft zu diesem Dagstuhl Seminar erteilen
Simone Schilke zu administrativen Fragen
Roswitha Bardohl zu wissenschaftlichen Fragen
Programm des Dagstuhl Seminars (Hochladen)
(Zum Einloggen bitte Seminarnummer und Zugangscode verwenden)
Much research on automated deduction has traditionally focused on automated reasoning in first-order logic. First-order logic with equality is generally considered a "sweet spot" on the logic design continuum. Yet, from the point of view of several applications it can be too restrictive as a modeling and reasoning tool. In recent years, there has been a realization that while first-order reasoning is very useful to discharge the bulk of proof obligations, it must be tightly integrated with richer features to be useful in many applications. Practical problems often need a mixture of first-order proof search and some more advanced reasoning, for instance, about non-first-order-axiomatizable theories, higher-order formulas, or simply higher-level reasoning steps.
First-order logic cannot be used to finitely axiomatize many interesting theories, such as those including transitive closure operators, inductive predicates, datatypes, and standard arithmetic on integers or reals. Even provers that provide native support for some of these theories typically fail to prove trivial-looking problems because they lack general support for induction. Some applications need a richer set of constructs than those provided by first-order logic such as, for instance, the separating conjunction (*) and magic wand (-*) connectives of Separation Logic or the disjunctive well-foundedness predicates used in HSF, a popular approach to software model checking based on first-order Horn logic.
There are potential synergies between automatic first-order proving and verification methods developed in the context of richer logics. However, they have not received enough attention by the various deduction subcommunities so far. In general, there is a cultural gap between the various deduction communities that hinders cross-fertilization of ideas and progress.
This Dagstuhl Seminar will bring together first-order reasoning experts and researchers working on deduction methods and tools that go beyond first-order logic. The latter include specialists on proof methods for induction, proof planning, and other higher-order or higher-level procedures; and consumers of deduction technology whose specification languages contain non-first-order features. The main goal of the seminar is to exchange ideas and explore ways to facilitate the transition from first-order to more expressive settings.
Research questions to be discussed at the seminar include the following:
- What higher-order features do applications need, and what features can be incorporated smoothly in existing first-order proof calculi and provers?
- How can we best extend first-order reasoning techniques beyond first-order logic?
- Can proof-assistant-style automation and first-order reasoning techniques be combined in a synergetic fashion?
- What are good strategies for automatic induction and coinduction or invariant synthesis?
- Is a higher layer of reasoning, in the spirit of proof planning, necessary to solve more difficult higher-order problems?
Creative Commons BY 3.0 DE
Jasmin Christian Blanchette and Carsten Fuhs and Viorica Sofronie-Stokkermans and Cesare Tinelli
Dagstuhl Seminar Series
- 15381: "Information from Deduction: Models and Proofs" (2015)
- 13411: "Deduction and Arithmetic" (2013)
- 09411: "Interaction versus Automation: The two Faces of Deduction" (2009)
- 07401: "Deduction and Decision Procedures" (2007)
- 05431: "Deduction and Applications" (2005)
- 03171: "Deduction and Infinite-state Model Checking" (2003)
- 01101: "Deduction" (2001)
- 99091: "Deduction" (1999)
- 9709: "Deduction" (1997)
- 9512: "Deduction" (1995)
- 9310: "Deduction" (1993)
- Artificial Intelligence / Robotics
- Semantics / Formal Methods
- Verification / Logic
- Automated reasoning
- Automated deduction
- Decision procedures
- Higher-order logic
- Formal proof
- Program verification