Defining the meaning of TPTP formatted proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Defining the meaning of TPTP formatted proofs

Abstract

The TPTP library is one of the leading problem libraries in the automated theorem proving community. Over time, support was added for problems beyond those in first-order clausal form. TPTP has also been augmented with support for various proof formats output by theorem provers. Such proofs can also be maintained in the TSTP proof library. In this paper we propose an extension of this framework to support the semantic specification of the inference rules used in proofs.
Fichier principal
Vignette du fichier
iwil2015_paper.pdf (314.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01238434 , version 1 (04-12-2015)

Identifiers

  • HAL Id : hal-01238434 , version 1

Cite

Roberto Blanco, Tomer Libal, Dale Miller. Defining the meaning of TPTP formatted proofs. 11th International Workshop on the Implementation of Logics, Nov 2015, Suva, Fiji. ⟨hal-01238434⟩
338 View
437 Download

Share

Gmail Facebook Twitter LinkedIn More