mlsanityData to 7 Oct 2026

Extensional Higher-Order Paramodulation in Leo-III

arXiv 1907.11501 ↗First posted 26 Jul 2019cs.AI cs.LO cs.SCcited by 11

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

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 2; 2026: 2.

11 papers.