Defining the meaning of TPTP formatted proofs

13 pages•Published: September 27, 2016

Roberto Blanco, Tomer Libal and Dale Miller

Abstract

The TPTP library is one of the leading problem libraries in the automated theorem proving community. Along the years, support was added for problems beyond those in first-order clausal form. Another addition was the augmentation of the language to support proofs outputted from theorem provers and the maintenance of a proof library, called TSTP. In this paper we propose another augmentation of the language for the support of the semantics of the inference rules used in these proofs.

Keyphrases: dedukti, proof certification, proofcert, tptp, tstp

In: Boris Konev, Stephan Schulz and Laurent Simon (editors). IWIL-2015. 11th International Workshop on the Implementation of Logics, vol 40, pages 78-90.

Links:	https://easychair.org/publications/paper/TLc2
	https://doi.org/10.29007/xtc2

BibTeX entry

@inproceedings{IWIL-2015:Defining_meaning_TPTP_formatted,
  author    = {Roberto Blanco and Tomer Libal and Dale Miller},
  title     = {Defining the meaning of TPTP formatted proofs},
  booktitle = {IWIL-2015. 11th International Workshop on the Implementation of Logics},
  editor    = {Boris Konev and Stephan Schulz and Laurent Simon},
  series    = {EPiC Series in Computing},
  volume    = {40},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/TLc2},
  doi       = {10.29007/xtc2},
  pages     = {78-90},
  year      = {2016}}

Download PDF Open PDF in browser