Understanding LEO-II’s proofs

20 pages•Published: November 25, 2013

Abstract

The LEO and LEO-II provers have pioneered the integration of higher-order and first-order automated theorem proving. To date, the LEO-II system is, to our knowledge, the only automated higher-order theorem prover which is capable of generating joint higher-order–first-order proof objects in TPTP format. This paper discusses LEO-II’s proof objects. The target audience are practitioners with an interest in using LEO-II proofs within other systems.

Keyphrases: automated theorem proving, higher order logic, proof objects

In: Konstantin Korovin, Stephan Schulz and Eugenia Ternovska (editors). IWIL 2012. The 9th International Workshop on the Implementation of Logics, vol 22, pages 33-52.

Links:	https://easychair.org/publications/paper/pNWc
	https://doi.org/10.29007/x9c9

BibTeX entry

@inproceedings{IWIL2012:Understanding_LEO_IIs_proofs,
  author    = {Nik Sultana and Christoph Benzmüller},
  title     = {Understanding LEO-II’s proofs},
  booktitle = {IWIL 2012. The 9th International Workshop on the Implementation of Logics},
  editor    = {Konstantin Korovin and Stephan Schulz and Eugenia Ternovska},
  series    = {EPiC Series in Computing},
  volume    = {22},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/pNWc},
  doi       = {10.29007/x9c9},
  pages     = {33-52},
  year      = {2013}}

Download PDF Open PDF in browser