LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
- 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
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.
Unable to display preview. Download preview PDF.