Formalizing Bachmair and Ganzinger's Ordered Resolution Prover

EasyChair Preprint 396

Abstract

We present a formalization of the first half of Bachmair and Ganzinger'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.

Keyphrases: Isabelle/HOL, completeness, first-order logic, proof assistant, prover, resolution

@booklet{EasyChair:396,
  author    = {Anders Schlichtkrull and Jasmin Christian Blanchette and Dmitriy Traytel and Uwe Waldmann},
  title     = {Formalizing Bachmair and Ganzinger's Ordered Resolution Prover},
  doi       = {10.29007/pn71},
  howpublished = {EasyChair Preprint 396},
  year      = {EasyChair, 2018}}