Skip to Main content Skip to Navigation
Conference papers

A Shallow Embedding of Resolution and Superposition Proofs into the ??-Calculus Modulo

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01126321
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:50:27 AM
Last modification on : Saturday, February 9, 2019 - 1:24:54 AM

Identifiers

  • HAL Id : hal-01126321, version 1

Collections

Citation

Guillaume Burel. A Shallow Embedding of Resolution and Superposition Proofs into the ??-Calculus Modulo. Third International Workshop on Proof Exchange for Theorem Proving, Jun 2013, Lake Placid, United States. ⟨hal-01126321⟩

Share

Metrics

Record views

54