Bibliographic Details
| Title: |
Extensional Higher-Order Paramodulation in Leo-III. |
| Authors: |
Steen, Alexander1 alexander.steen@uni.lu, Benzmüller, Christoph1,2 |
| Source: |
Journal of Automated Reasoning. Aug2021, Vol. 65 Issue 6, p775-807. 33p. |
| Subjects: |
Deontic logic, Automatic theorem proving, Proof theory, Source code, Boolean functions |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
