Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered cooperative higher-order-first-order proof automation, it has influenced the development of the TPTP THF infrastructure for higher-order logic, and it has been applied in a wide array of problems. Leo-II may also be called in proof assistants as an external aid tool to save user effort. For this it is crucial that Leo-II returns proof information in a standardised syntax, so that these proofs can eventually be transformed and verified within proof assistants. Recent progress in this direction is reported for the Isabelle/HOL system.The Leo-II project has been supported by the following grants: EPSRC grant EP/D070511/1 and DFG grants BE/2501 6-1,...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
International audienceDecades of work have gone into developing efficient proof calculi, data struct...
One of the main success stories of automatic theorem provers has been their integration into proof a...
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...
The Leo and Leo-II provers have pioneered the integration of higher-order and first-order automated ...
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 effective automated theorem prover for extensional type theory with Henkin semantics. ...
International audienceAbstract Most users of proof assistants want more proof automation. Some proof...
peer reviewedLeo-III is an automated theorem prover for (polymorphic) higher-order logic which suppo...
We report on the application of higher-order automated theorem proving in ontology reasoning. Concre...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
International audienceDecades of work have gone into developing efficient proof calculi, data struct...
One of the main success stories of automatic theorem provers has been their integration into proof a...
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...
The Leo and Leo-II provers have pioneered the integration of higher-order and first-order automated ...
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 effective automated theorem prover for extensional type theory with Henkin semantics. ...
International audienceAbstract Most users of proof assistants want more proof automation. Some proof...
peer reviewedLeo-III is an automated theorem prover for (polymorphic) higher-order logic which suppo...
We report on the application of higher-order automated theorem proving in ontology reasoning. Concre...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
International audienceDecades of work have gone into developing efficient proof calculi, data struct...
One of the main success stories of automatic theorem provers has been their integration into proof a...