The Higher-Order Prover Leo-III [chapter]

Alexander Steen, Christoph Benzmüller
2018 Lecture Notes in Computer Science  
The automated theorem prover Leo-III for classical higherorder 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 manysorted first-order logic and
more » ... ces verifiable proof certificates. The prover is evaluated on heterogeneous benchmark sets.
doi:10.1007/978-3-319-94205-6_8 fatcat:5qspukjutnemtglrulv6fp3gp4