Extensional Higher-Order Paramodulation in Leo-III
Not on the map. Why?
Abstract (arXiv)
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 all normal quantified 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.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 2; 2026: 2.
11 papers.
- 2022Automated Reasoning in Non-classical Logics in the TPTP Worldcited by 4
- 2022An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoningcited by 4
- 2025Faithful Logic Embeddings in HOL -- Deep and Shallowcited by 3
- 2022Bridging between LegalRuleML and TPTP for Automated Normative Reasoning (extended version)cited by 2
- 2021A Formalisation of Abstract Argumentation in Higher-Order Logiccited by 1
- 2025TPTP World Infrastructure for Non-classical Logicscited by 1
- 2026Many Logics, One Methodology: A Plea for Logical Pluralism in Formalised Reasoning (preprint)cited by 1
- 2023Theorem Proving in Dependently-Typed Higher-Order Logic -- Extended Preprintcited by 0
- 2023An Encoding of Abstract Dialectical Frameworks into Higher-Order Logiccited by 0
- 2024Experiments with Choice in Dependently-Typed Higher-Order Logiccited by 0
- 2026Same Formulas, Different Semantics: Do Language Models Follow Modal Logic Specifications?cited by 0
- 2026Same Formulas, Different Semantics: Do Language Models Follow Modal Logic Specifications?5 Aug 2026
- 2026Many Logics, One Methodology: A Plea for Logical Pluralism in Formalised Reasoning (preprint)26 May 2026
- 2025TPTP World Infrastructure for Non-classical Logics12 Aug 2025
- 2025Faithful Logic Embeddings in HOL -- Deep and Shallow26 Feb 2025
- 2024Experiments with Choice in Dependently-Typed Higher-Order Logic11 Oct 2024
- 2023An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic8 Dec 2023
- 2023Theorem Proving in Dependently-Typed Higher-Order Logic -- Extended Preprint24 May 2023
- 2022Bridging between LegalRuleML and TPTP for Automated Normative Reasoning (extended version)12 Sep 2022
- 2022An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoning23 Mar 2022
- 2022Automated Reasoning in Non-classical Logics in the TPTP World20 Feb 2022
- 2021A Formalisation of Abstract Argumentation in Higher-Order Logic18 Oct 2021