Importing SMT and Connection proofs as expansion trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Importing SMT and Connection proofs as expansion trees


Different automated theorem provers reason in various deductive systems and, thus, produce proof objects which are in general not compatible. To understand and analyze these objects, one needs to study the corresponding proof theory, and then study the language used to represent proofs, on a prover by prover basis. In this work we present an implementation that takes SMT and Connection proof objects from two different provers and imports them both as expansion trees. By representing the proofs in the same framework, all the algorithms and tools available for expansion trees (compression , visualization, sequent calculus proof construction, proof checking, etc.) can be employed uniformly. The expansion proofs can also be used as a validation tool for the proof objects produced.
Fichier principal
Vignette du fichier
1507.08715v1.pdf (89.34 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01208325 , version 1 (05-10-2015)



Giselle Reis. Importing SMT and Connection proofs as expansion trees. PxTP 2015 - Proceedings Fourth Workshop on Proof eXchange for Theorem Proving, Aug 2015, Berlin, Germany. ⟨10.4204/EPTCS.186.3⟩. ⟨hal-01208325⟩
73 View
79 Download



Gmail Facebook X LinkedIn More