Abstract
The automated theorem prover Leo-III for classical higher-order logic with Henkin semantics and choice is presented. Leo-III is based on extensional higher-order paramodulation and accepts every common TPTP dialect (FOF, TFF, THF), including their recent extensions to rank-1 polymorphism (TF1, TH1). In addition, the prover natively supports almost every normal higher-order modal logic. Leo-III cooperates with first-order reasoning tools using translations to many-sorted first-order logic and produces verifiable proof certificates. The prover is evaluated on heterogeneous benchmark sets.
Cite
CITATION STYLE
Steen, A., & Benzmüller, C. (2018). The Higher-Order Prover Leo-III. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10900 LNAI, pp. 108–116). Springer Verlag. https://doi.org/10.1007/978-3-319-94205-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
