Extensional Higher-Order Paramodulation in Leo-III

被引:14
作者
Steen, Alexander [1 ]
Benzmuller, Christoph [1 ,2 ]
机构
[1] Univ Luxembourg, FSTM, Esch Sur Alzette, Luxembourg
[2] Free Univ Berlin, Dept Math & Comp Sci, Berlin, Germany
关键词
Higher-Order logic; Henkin semantics; Extensionality; Leo-III; Equational reasoning; Automated theorem proving; Non-classical logics; Quantified modal logics; GENERAL MODELS; UNIFICATION; UNDECIDABILITY; RESOLUTION; PROVER; TPTP;
D O I
10.1007/s10817-021-09588-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:775 / 807
页数:33
相关论文
共 106 条