ArticlePublisher preview available

Extensional Higher-Order Paramodulation in Leo-III

DOI:10.1007/s10817-021-09588-x
Authors:
Alexander Steen at University of Greifswald
Alexander Steen
Christoph Benzmüller at Otto-Friedrich-Universität Bamberg
Christoph Benzmüller
Read publisher preview
Download citation
To read the full-text of this research, you can request a copy directly from the authors.

Abstract and Figures

Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based proof search to higher-order logic. The prover may cooperate with multiple external specialist reasoning systems such as first-order provers and SMT solvers. Leo-III is compatible with the TPTP/TSTP framework for input formats, reporting results and proofs, and standardized communication between reasoning systems, enabling, e.g., proof reconstruction from within proof assistants such as Isabelle/HOL. Leo-III supports reasoning in polymorphic first-order and higher-order logic, in many quantified normal modal logics, as well as in different deontic logics. Its development had initiated the ongoing extension of the TPTP infrastructure to reasoning within non-classical logics.
Figures - available from: Journal of Automated Reasoning
This content is subject to copyright. Terms and conditions apply.
  • A preview of this full-text is provided by Springer Nature.
  • Learn more
Preview content only
Content available from Journal of Automated Reasoning
This content is subject to copyright. Terms and conditions apply.
Journal of Automated Reasoning (2021) 65:775–807
https://doi.org/10.1007/s10817-021-09588-x
Extensional Higher-Order Paramodulation in Leo-III
Alexander Steen1·Christoph Benzmüller1,2
Received: 26 July 2019 / Accepted: 8 March 2021 / Published online: 27 March 2021
© The Author(s), under exclusive licence to Springer Nature B.V. 2021
Abstract
Leo-III is an automated theorem prover for extensional type theory with Henkin semantics
and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based
proof search to higher-order logic. The prover may cooperate with multiple external specialist
reasoning systems such as first-order provers and SMT solvers. Leo-III is compatible with
the TPTP/TSTP framework for input formats, reporting results and proofs, and standardized
communication between reasoning systems, enabling, e.g., proof reconstruction from within
proof assistants such as Isabelle/HOL. Leo-III supports reasoning in polymorphic first-order
and higher-order logic, in many quantified normal modal logics, as well as in different deontic
logics. Its development had initiated the ongoing extension of the TPTP infrastructure to
reasoning within non-classical logics.
Keywords Higher-Order logic ·Henkin semantics ·Extensionality ·Leo-III ·Equational
reasoning ·Automated theorem proving ·Non-classical logics ·Quantified modal logics
1 Introduction
Leo-III is an automated theorem prover (ATP) for classical higher-order logic (HOL) with
Henkin semantics and choice. In contrast to its predecessors, LEO and LEO-II [25,33], that
were based on resolution proof search, Leo-III implements a higher-order paramodulation
calculus, which aims at improved performance for equational reasoning [89]. In the tradition
of the Leo prover family, Leo-III collaborates with external reasoning systems, in particular,
with first-order ATP systems, such as E [85], iProver [70]andVampire[83], and with SMT
solvers such as CVC4 [14]. Cooperation is not restricted to first-order systems, and further
specialized systems such as higher-order (counter)model finders may be utilized by Leo-III.
This work has been supported by the DFG under Grant BE 2501/11-1 (Leo-III) and by the
Volkswagenstiftung (“Consistent Rational Argumentation in Politics”).
BAlexander Steen
alexander.steen@uni.lu
Christoph Benzmüller
c.benzmueller@fu-berlin.de
1University of Luxembourg, FSTM, Esch-sur-Alzette, Luxembourg
2Department of Mathematics and Computer Science, Freie Universität Berlin, Berlin, Germany
123
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
... They dominate at the annual CASC [47] theorem prover competition, having always won the first-order theorem division. They are also used as backends to proof assistants [13,26,37], automatic higher-order theorem provers [44], and software verifiers [17]. ...
... Nevertheless, our working hypothesis for the past six years has been that superposition would likely provide a stronger basis for higher-order reasoning. Other competing higher-order calculi include SMT (implemented in CVC4 [3,4]) and extensional paramodulation (implemented in Leo-III [44]). ...
... The portfolio was designed to solve as many problems as possible from the TPTP benchmark set. To provide some context, we compare Zipperposition 2 with the latest versions of all higher-order provers that competed at CASC-J10: CVC4 1.9 [4], Leo-III 1.5.6 [44], Satallax 3.5 [11], and Vampire 4.5.1 [10]. The provers were run using the same parameters as in CASC, but with updated executables. ...
Making Higher-Order Superposition Work
Article
Full-text available
Superposition is among the most successful calculi for first-order logic. Its extension to higher-order logic introduces new challenges such as infinitely branching inference rules, new possibilities such as reasoning about Booleans, and the need to curb the explosion of specific higher-order rules. We describe techniques that address these issues and extensively evaluate their implementation in the Zipperposition theorem prover. Largely thanks to their use, Zipperposition won the higher-order division of the CASC-J10 competition.
... A suite of tools that can read, manipulate, and reason over problems written in the NXF and NHF languages is available in the Leo-III framework [51]. 8 Leo-III's parser is available as a stand-alone parsing library [52]. ...
Automated Reasoning in Non-classical Logics in the TPTP World
Conference Paper
Full-text available
  • Jul 2022
Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastructure for automated theorem proving, the TPTP World, currently supports only classical logics. This paper describes the latest extension of the TPTP World, providing languages and infrastructure for reasoning in non-classical logics. The extension integrates seamlessly with the existing TPTP World.
... This embedding is most closely related to the relational translation in that it employs a representation of the worlds and accessibility relationship in Kripke frames and deals with modal logics other than the basic modal logic K by adding the corresponding frame properties. LEO-III implements extensional paramodulation for higher-order logic [37] but can also collaborate with external reasoners during proof search. In our evaluation, we have exclusively used E 2.6 [33,34] as external reasoner. ...
Local is Best: Efficient Reductions to Modal Logic K
Article
Full-text available
We present novel reductions of extensions of the basic modal logic $${\textsf {K} }$$ K with axioms $$\textsf {B} $$ B , $$\textsf {D} $$ D , $$\textsf {T} $$ T , $$\textsf {4} $$ 4 and $$\textsf {5} $$ 5 to Separated Normal Form with Sets of Modal Levels $$\textsf {SNF} _{sml}$$ SNF sml . The reductions typically result in smaller formulae than the reductions by Kracht. The reductions to $$\textsf {SNF} _{sml}$$ SNF sml combined with a reduction to $$\textsf {SNF} _{sml}$$ SNF sml allow us to use the local reasoning of the prover $${\text {K}_{_\text {S}}}{\text {P}}$$ K S P to determine the satisfiability of modal formulae in the considered logics. We show experimentally that the combination of our reductions with the prover $${\text {K}_{_\text {S}}}{\text {P}}$$ K S P performs well when compared with a specialised resolution calculus for these logics, the built-in reductions of the first-order prover SPASS, and the higher-order logic prover LEO-III.
... The basic calculus of Satallax is a complete ground tableau calculus [5,6,2]. In recent years the top systems of the THF division of CASC are primarily based on resolution and superposition [11,3,8]. At the moment it is an open question whether there is a research and development path via which a tableau based prover could again become competitive. ...
Lash 1.0 (System Description)
Preprint
  • May 2022
Lash is a higher-order automated theorem prover created as a fork of the theorem prover Satallax. The basic underlying calculus of Satallax is a ground tableau calculus whose rules only use shallow information about the terms and formulas taking part in the rule. Lash uses new, efficient C representations of vital structures and operations. Most importantly, Lash uses a C representation of (normal) terms with perfect sharing along with a C implementation of normalizing substitutions. We describe the ways in which Lash differs from Satallax and the performance improvement of Lash over Satallax when used with analogous flag settings. With a 10s timeout Lash outperforms Satallax on a collection TH0 problems from the TPTP. We conclude with ideas for continuing the development of Lash.
... The functionality of LET is illustrated by a number of examples. Exemplary ATP system results are produced by the higher-order prover Leo-III [35], version 1.6.8, in which LET is integrated as a library and accessed via its API. Leo-III parses the problems, invokes the embedding API, and then applies standard proof search on the resultant THF problem. in a first-order variant, is a modal logic formula that is valid if and only if the quantification domain of the underlying first-order modal logic model is noncumulative [17]. ...
An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoning
Preprint
  • Mar 2022
The logic embedding tool provides a procedural encoding for non-classical reasoning problems into classical higher-order logic. It is extensible and can support an increasing number of different non-classical logics as reasoning targets. When used as a pre-processor or library for higher-order theorem provers, the tool admits off-the-shelf automation for logics for which otherwise few to none provers are currently available.
... At the time of writing there is already one tool chain that can read, manipulate, and reason over problems written in the TXN and THN languages, provided in the Leo-III framework [38]. Leo-III's parser [35], also available as a stand-alone parsing library in Scala, can read both languages. ...
Automated Reasoning in Non-classical Logics in the TPTP World
Preprint
  • Feb 2022
Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastructure for automated theorem proving, the TPTP World, currently supports only classical logics. Similar standards for non-classical logic reasoning do not exist (yet). This hampers practical development of reasoning systems, and limits their interoperability and application. This paper describes the latest extension of the TPTP World, which provides languages and infrastructure for reasoning in non-classical logics. The extensions integrate seamlessly with the existing TPTP World.
... One of the most relevant practical features of Isabelle/HOL is the Sledgehammer system [21] that bridges between the proof assistant and external ATP systems, such as the first-order ATP system E [52] or the higher-order ATP system Leo-III [55], and SMT solvers such as Z3 [35] and CVC4 [7]. The idea Analogously, terms of type τ ⇒ o (for τ ∈ T ) are suggestively called "predicates" (over type τ ). ...
A Formalisation of Abstract Argumentation in Higher-Order Logic
Preprint
Full-text available
  • Oct 2021
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools. This enables the formal analysis and verification of meta-theoretical properties as well as the flexible generation of extensions and labellings with respect to well-known argumentation semantics.
Local Reductions for the Modal Cube
Chapter
  • Aug 2022
The modal logic K is commonly used to represent and reason about necessity and possibility and its extensions with combinations of additional axioms are used to represent knowledge, belief, desires and intentions. Here we present local reductions of all propositional modal logics in the so-called modal cube, that is, extensions of K with arbitrary combinations of the axioms B, D, T, 4 and 5 to a normal form comprising a formula and the set of modal levels it occurs at. Using these reductions we can carry out reasoning for all these logics with the theorem prover . We define benchmarks for these logics and experiment with the reduction approach as compared to an existing resolution calculus with specialised inference rules for the various logics.
Lash 1.0 (System Description)
Chapter
  • Aug 2022
Lash is a higher-order automated theorem prover created as a fork of the theorem prover Satallax. The basic underlying calculus of Satallax is a ground tableau calculus whose rules only use shallow information about the terms and formulas taking part in the rule. Lash uses new, efficient C representations of vital structures and operations. Most importantly, Lash uses a C representation of (normal) terms with perfect sharing along with a C implementation of normalizing substitutions. We describe the ways in which Lash differs from Satallax and the performance improvement of Lash over Satallax when used with analogous flag settings. With a 10 s timeout Lash outperforms Satallax on a collection TH0 problems from the TPTP. We conclude with ideas for continuing the development of Lash.
Automated Deduction – CADE 28 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings: 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings
Book
Full-text available
This open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions.
Computer Science and Metaphysics: A Cross-Fertilization
Article
Full-text available
  • Aug 2019
Computational philosophy is the use of mechanized computational techniques to unearth philosophical insights that are either difficult or impossible to find using traditional philosophical methods. Computational metaphysics is computational philosophy with a focus on metaphysics. In this paper, we (a) develop results in modal metaphysics whose discovery was computer assisted, and (b) conclude that these results work not only to the obvious benefit of philosophy but also, less obviously, to the benefit of computer science, since the new computational techniques that led to these results may be more broadly applicable within computer science. The paper includes a description of our background methodology and how it evolved, and a discussion of our new results.
A Dyadic Deontic Logic in HOL
Conference Paper
Full-text available
  • Jul 2018
A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. This embedding is proven sound and complete, that is, faithful. The work presented here provides the theoretical foundation for the implementation and automation of dyadic deontic logic within o-the-shelf higher-order theorem provers and proof assistants.
Universal (Meta-)Logical Reasoning: Recent Successes
Article
Full-text available
Classical higher-order logic, when utilized as a meta-logic in which various other (classical and non-classical) logics can be shallowly embedded, is suitable as a foundation for the development of a universal logical reasoning engine. Such an engine may be employed, as already envisioned by Leibniz, to support the rigorous formalisation and deep logical analysis of rational arguments on the computer. A respective universal logical reasoning framework is described in this article and a range of successful first applications in philosophy, artificial intelligence and mathematics are surveyed.
The MET: The Art of Flexible Reasoning with Modalities: Second International Joint Conference, RuleML+RR 2018, Luxembourg, Luxembourg, September 18–21, 2018, Proceedings
Chapter
Full-text available
  • Aug 2018
Modal logics have numerous applications in computational linguistics, artificial intelligence, rule-based reasoning, and, in general, alethic, deontic and epistemic contexts. Higher-order quantified modal logics additionally incorporate the expressiveness of higher-order formalisms and thereby provide a quite general reasoning framework. By exploiting this expressiveness, the Modal Embedding Tool (MET) allows to automatically encode higher-order modal logic problems into equivalent problems of classical logic, enabling the use of a broad variety of established reasoning tools. In this system description, the functionality and usage of MET as well as a suitable input syntax for flexible reasoning with modalities are presented.
Extensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-III
Article
  • Oct 2019
Automation of classical higher-order logic faces various theoretical and practical challenges. On a theoretical level, powerful calculi for effective equality reasoning from first-order theorem proving cannot be lifted to the higher-order domain in a simple manner. Practically, implementations of higher-order reasoning systems have to incorporate procedures that often have high time complexity or are not decidable in general. In my dissertation, both the theoretical and the practical challenges of designing an effective higher-order reasoning system are studied. The resulting system, the automated theorem prover Leo-III, is one of the most effective and versatile systems, in terms of supported logical formalisms, to date.
Restricted Combinatory Unification
Chapter
  • Aug 2019
First-order theorem provers are commonly utilised as backends to proof assistants. In order to improve efficiency, it is desirable that such provers can carry out some higher-order reasoning. In his 1991 paper, Dougherty proposed a combinatory unification algorithm for higher-order logic. The algorithm removes the need to deal with \(\lambda \)-binders and \(\alpha \)-renaming, making it attractive to implement in first-order provers. However, since publication it has garnered little interest due to a number of characteristics that make it unsuitable for a practical implementation. It fails to terminate on many trivial instances and requires polymorphism. We present a restricted version of Dougherty’s algorithm that is incomplete, terminating and does not require polymorphism. Further, we describe its implementation in the Vampire theorem prover, including a novel use of a substitution tree as a filtering index for higher-order unification. Finally, we analyse the performance of the algorithm on two benchmark sets and show that it is competitive.
GRUNGE: A Grand Unified ATP Challenge
Chapter
  • Aug 2019
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type variables) and first-order logic (possibly with types, and possibly with type variables). The resultant problem sets allow us to run automated theorem provers that support different logical formalisms on corresponding problems, and compare their performances. This also results in a new “grand unified” large theory benchmark that emulates the ITP/ATP hammer setting, where systems and metasystems can use multiple formalisms in complementary ways, and jointly learn from the accumulated knowledge.
Extending SMT Solvers to Higher-Order Logic
Chapter
  • Aug 2019
SMT solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic (FOL). In contrast, the extension of SMT solvers to higher-order logic (HOL) is mostly unexplored. We propose a pragmatic extension for SMT solvers to support HOL reasoning natively without compromising performance on FOL reasoning, thus leveraging the extensive research and implementation efforts dedicated to efficient SMT solving. We show how to generalize data structures and the ground decision procedure to support partial applications and extensionality, as well as how to reconcile quantifier instantiation techniques with higher-order variables. We also discuss a separate approach for redesigning an HOL SMT solver from the ground up via new data structures and algorithms. We apply our pragmatic extension to the CVC4 SMT solver and discuss a redesign of the veriT SMT solver. Our evaluation shows they are competitive with state-of-the-art HOL provers and often outperform the traditional encoding into FOL.
Superposition with Lambdas
Chapter
  • Aug 2019
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on \(\beta \eta \)-equivalence classes of \(\lambda \)-terms and rely on higher-order unification to achieve refutational completeness. We implemented the calculus in the Zipperposition prover and evaluated it on TPTP and Isabelle benchmarks. The results suggest that superposition is a suitable basis for higher-order reasoning.
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
Chapter
  • Apr 2019
Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition-based prover E and gradually enrich it with higher-order features. We explain how to extend the prover’s data structures, algorithms, and heuristics to \(\lambda \)-free higher-order logic, a formalism that supports partial application and applied variables. Our extension outperforms the traditional encoding and appears promising as a stepping stone towards full higher-order logic.