{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:42:20Z","timestamp":1725493340089},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.29007\/xtc2","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:04:19Z","timestamp":1516730659000},"page":"78-64","source":"Crossref","is-referenced-by-count":0,"title":["Defining the meaning of TPTP formatted proofs"],"prefix":"10.29007","volume":"40","author":[{"given":"Roberto","family":"Blanco","sequence":"first","affiliation":[]},{"given":"Tomer","family":"Libal","sequence":"additional","affiliation":[]},{"given":"Dale","family":"Miller","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"IWIL-2015. 11th International Workshop on the Implementation of Logics"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:04:23Z","timestamp":1516730663000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/TLc2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/xtc2","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}