Leo-IIILeo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all common TPTP dialects, including THF, TFF and FOF as well as their rank-1 polymorphic derivatives. It is based on a paramodulation calculus with additional ordering constraints and, in tradition of its predecessor LEO-II, heavily relies on cooperation with external (mostly first-order) theorem provers for increased performance. Nevertheless, Leo-III can also be used as a stand-alone prover without employing any external cooperation
Abstract. Leo-II, a resolution based theorem prover for classical higherorder logic, is currently be...
Leo-II cooperates with other theorem-provers to prove theorems in classical higherorder logic. It re...
LEO-II, a resolution based theorem prover for classical higher-order logic, is currently being devel...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
peer reviewedLeo-III is an automated theorem prover for (polymorphic) higher-order logic which suppo...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
Leo-III is an effective automated theorem prover for extensional type theory with Henkin semantics. ...
peer reviewedWhile interactive proof assistants for higher-order logic (HOL) commonly admit reasonin...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
The Leo and Leo-II provers have pioneered the integration of higher-order and first-order automated ...
Abstract. Leo-II, a resolution based theorem prover for classical higherorder logic, is currently be...
Leo-II cooperates with other theorem-provers to prove theorems in classical higherorder logic. It re...
LEO-II, a resolution based theorem prover for classical higher-order logic, is currently being devel...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all commo...
peer reviewedLeo-III is an automated theorem prover for (polymorphic) higher-order logic which suppo...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
Leo-III is an effective automated theorem prover for extensional type theory with Henkin semantics. ...
peer reviewedWhile interactive proof assistants for higher-order logic (HOL) commonly admit reasonin...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
The Leo and Leo-II provers have pioneered the integration of higher-order and first-order automated ...
Abstract. Leo-II, a resolution based theorem prover for classical higherorder logic, is currently be...
Leo-II cooperates with other theorem-provers to prove theorems in classical higherorder logic. It re...
LEO-II, a resolution based theorem prover for classical higher-order logic, is currently being devel...