A Shallow Embedding of Resolution and Superposition Proofs into the $\lambda\Pi$-Calculus Modulo

15 pages•Published: May 26, 2013

Abstract

The λΠ-calculus modulo is a proof language that has been proposed as a proof standard
for (re-)checking and interoperability. Resolution and superposition are proof-search methods that are used in state-of-the-art first-order automated theorem provers. We provide a shallow embedding of resolution and superposition proofs in the λΠ-calculus modulo, thus offering a way to check these proofs in a trusted setting, and to combine them with other proofs. We implement this embedding as a backend of the prover iProver Modulo.

Keyphrases: automatic theorem provers, interoperability, proof checking, rewriting

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

Links:	https://easychair.org/publications/paper/jZZS
	https://doi.org/10.29007/ftc2

BibTeX entry

@inproceedings{PxTP2013:Shallow_Embedding_Resolution_Superposition,
  author    = {Guillaume Burel},
  title     = {A Shallow Embedding of Resolution and Superposition Proofs into the $\lambda\Pi$-Calculus Modulo},
  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/jZZS},
  doi       = {10.29007/ftc2},
  pages     = {43-57},
  year      = {2013}}

Download PDF Open PDF in browser