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

  • Christoph Benzmüller
  • Lawrence C. Paulson
  • Frank Theiss
  • Arnaud Fietzke
Conference paper

DOI: 10.1007/978-3-540-71070-7_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5195)
Cite this paper as:
Benzmüller C., Paulson L.C., Theiss F., Fietzke A. (2008) LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description). In: Armando A., Baumgartner P., Dowek G. (eds) Automated Reasoning. IJCAR 2008. Lecture Notes in Computer Science, vol 5195. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christoph Benzmüller
    • 1
  • Lawrence C. Paulson
    • 2
  • Frank Theiss
    • 1
  • Arnaud Fietzke
    • 3
  1. 1.Dep. of Computer ScienceSaarland UniversitySaarbrückenGermany
  2. 2.Computer LaboratoryThe University of CambridgeUK
  3. 3.Max Planck Institute for Informatics SaarbrückenGermany

Personalised recommendations