Leo-II cooperates with other theorem-provers to prove theorems in classical higherorder logic. It returns hybrid proofs, which contain inferences made by Leo-II as well as the backend provers with which it cooperates. This article describes recent improvements made to Leo-II.
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
Leo-IIILeo-III is an automated theorem prover for (polymorphic) higher-order logic which supports al...
We report on the application of higher-order automated theorem proving in ontology reasoning. Concre...
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...
Abstract. Leo-II, a resolution based theorem prover for classical higherorder logic, is currently be...
LEO-II, a resolution based theorem prover for classical higher-order logic, is currently being devel...
The Leo and Leo-II provers have pioneered the integration of higher-order and first-order automated ...
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 effective automated theorem prover for extensional type theory with Henkin semantics. ...
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-IIILeo-III is an automated theorem prover for (polymorphic) higher-order logic which supports al...
We report on the application of higher-order automated theorem proving in ontology reasoning. Concre...
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...
Abstract. Leo-II, a resolution based theorem prover for classical higherorder logic, is currently be...
LEO-II, a resolution based theorem prover for classical higher-order logic, is currently being devel...
The Leo and Leo-II provers have pioneered the integration of higher-order and first-order automated ...
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 effective automated theorem prover for extensional type theory with Henkin semantics. ...
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-IIILeo-III is an automated theorem prover for (polymorphic) higher-order logic which supports al...
We report on the application of higher-order automated theorem proving in ontology reasoning. Concre...
Add to ORKG