Extended Resolution as Certificates for Propositional Logic

14 pages•Published: May 26, 2013

Abstract

When checking answers coming from automatic provers, or when skeptically integrating them into proof assistants, a major problem is the wide variety of formats of certificates, which forces to write lots of different checkers. In this paper, we propose to use the extended resolution as a common format for every propositional prover. To be able to do this, we detail two algorithms transforming proofs computed respectively by tableaux provers and provers based on {\bdd}s into this format. Since this latter is already implemented for SAT solvers, it is now possible for the three most common propositional provers to share the same certificates.

Keyphrases: analytic tableaux, binary decision diagrams, certificates, extended resolution, tableaux

In: Jasmin Christian Blanchette and Josef Urban (editors). PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving, vol 14, pages 96-109.

Links:	https://easychair.org/publications/paper/Mp3J
	https://doi.org/10.29007/vrpk

BibTeX entry

@inproceedings{PxTP2013:Extended_Resolution_as_Certificates,
  author    = {Chantal Keller},
  title     = {Extended Resolution as Certificates for Propositional Logic},
  booktitle = {PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving},
  editor    = {Jasmin Christian Blanchette and Josef Urban},
  series    = {EPiC Series in Computing},
  volume    = {14},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Mp3J},
  doi       = {10.29007/vrpk},
  pages     = {96-109},
  year      = {2013}}

Download PDF Open PDF in browser