Using the TPTP Language for Representing Derivations in Tableau and Connection Calculi

11 pages•Published: May 16, 2012

Abstract

The TPTP language, developed within the framework of the TPTP library, allows the representation of problems and solutions in first-order and higher-order logic. Whereas the writing of solutions in resolution calculi is well documented and used, an appropriate representation of solutions in tableau or connection calculi using the TPTP syntax has not yet been specified. This paper describes how the TPTP language can be used to represent derivations and solutions in standard tableau, sequent and connection calculi for classical first-order logic.

Keyphrases: connection calculus, tableau calculus, tptp language

In: Renate A. Schmidt, Stephan Schulz and Boris Konev (editors). PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, vol 9, pages 95-105.

Links:	https://easychair.org/publications/paper/MKr
	https://doi.org/10.29007/jcqn

BibTeX entry

@inproceedings{PAAR-2010:Using_TPTP_Language_Representing,
  author    = {Jens Otten and Geoff Sutcliffe},
  title     = {Using the TPTP Language for Representing Derivations in Tableau and
Connection Calculi},
  booktitle = {PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Renate A. Schmidt and Stephan Schulz and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/MKr},
  doi       = {10.29007/jcqn},
  pages     = {95-105},
  year      = {2012}}

Download PDF Open PDF in browser