LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

Authors:
Christoph Benzmüller;Lawrence C. Paulson;Frank Theiss;Arnaud Fietzke
Affiliations:
Dep. of Computer Science, Saarland University, Saarbrücken, Germany;Computer Laboratory, The University of Cambridge, UK;Dep. of Computer Science, Saarland University, Saarbrücken, Germany;Max Planck Institute for Informatics, , Saarbrücken, Germany
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 12
Cited 24

Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Experiments with discrimination-tree indexing and path indexing for term retrieval

Journal of Automated Reasoning
Experiments with an Agent-Oriented Reasoning System

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Solving for Set Variables in Higher-Order Theorem Proving

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Selectively Instantiating Definitions

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
On the Evaluation of Indexing Techniques for Theorem Proving

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
S PASS Version 2.0

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
System Description: LEO - A Higher-Order Theorem Prover

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Mathematical Induction in Otter-Lambda

Journal of Automated Reasoning
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
THF0 --- The Core of the TPTP Language for Higher-Order Logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning

THF0 --- The Core of the TPTP Language for Higher-Order Logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Progress in the Development of Automated Theorem Proving for Higher-Order Logic

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Terminating Tableaux for the Basic Fragment of Simple Type Theory

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining logics in simple type theory

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
The 5th IJCAR automated theorem proving system competition - CASC-J5

AI Communications
The TPTP world - infrastructure for automated reasoning

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Modal Access Control LogicAxiomatization, Semantics and FOL Theorem Proving

Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Extending Sledgehammer with SMT solvers

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Reducing higher-order theorem proving to a sequence of SAT problems

CADE'11 Proceedings of the 23rd international conference on Automated deduction
A foundational view on integration problems

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Automated Inference of Finite Unsatisfiability

Journal of Automated Reasoning
Analytic Tableaux for Higher-Order Logic with Choice

Journal of Automated Reasoning
Combining and automating classical and non-classical logics in classical higher-order logics

Annals of Mathematics and Artificial Intelligence
Higher-order aspects and context in SUMO

Web Semantics: Science, Services and Agents on the World Wide Web
Analytic tableaux for higher-order logic with choice

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Reasoning on schemata of formulæ

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Satallax: an automatic higher-order prover

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The QMLTP problem library for first-order modal logics

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
MaSh: machine learning for sledgehammer

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Automating quantified conditional logics in HOL

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Theorem proving in large formal mathematics as an emerging AI field

Automated Reasoning and Mathematics
Sigma: An integrated development environment for formal ontology

AI Communications - Intelligent Engineering Techniques for Knowledge Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with specialist provers for natural fragments of higher-order logic. At present LEO-II can cooperate with the first-order automated theorem provers E, SPASS, and Vampire. The improved performance of LEO-II, especially in comparison to its predecessor LEO, is due to several novel features including the exploitation of term sharing and term indexing techniques, support for primitive equality reasoning, and improved heuristics at the calculus level. LEO-II is implemented in Objective Caml and its problem representation language is the new TPTP THF language.