Formalizing Bachmair and Ganzinger's Ordered Resolution Prover

Abstract : We present a formalization of the first half of Bachmair and Ganz-inger's chapter on resolution theorem proving in Isabelle/HOL, culminating with a refutationally complete first-order prover based on ordered resolution with literal selection. We develop general infrastructure and methodology that can form the basis of completeness proofs for related calculi, including superposition. Our work clarifies several of the fine points in the chapter's text, emphasizing the value of formal proofs in the field of automated reasoning.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-01904610
Contributor : Jasmin Christian Blanchette <>
Submitted on : Thursday, October 25, 2018 - 10:52:43 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Document(s) archivé(s) le : Saturday, January 26, 2019 - 1:18:44 PM

File

rp_paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01904610, version 1

Collections

Citation

Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel, Uwe Waldmann. Formalizing Bachmair and Ganzinger's Ordered Resolution Prover. IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. ⟨hal-01904610⟩

Share

Metrics

Record views

79

Files downloads

13