Formalization of Bachmair and Ganzinger's Ordered Resolution Prover


Title: Formalization of Bachmair and Ganzinger's Ordered Resolution Prover
Authors: Anders Schlichtkrull, Jasmin Christian Blanchette (j /dot/ c /dot/ blanchette /at/ vu /dot/ nl), Dmitriy Traytel and Uwe Waldmann (uwe /at/ mpi-inf /dot/ mpg /dot/ de)
Submission date: 2018-01-18
Abstract: This Isabelle/HOL formalization covers Sections 2 to 4 of Bachmair and Ganzinger's "Resolution Theorem Proving" chapter in the Handbook of Automated Reasoning. This includes soundness and completeness of unordered and ordered variants of ground resolution with and without literal selection, the standard redundancy criterion, a general framework for refutational theorem proving, and soundness and completeness of an abstract first-order prover.
  author  = {Anders Schlichtkrull and Jasmin Christian Blanchette and Dmitriy Traytel and Uwe Waldmann},
  title   = {Formalization of Bachmair and Ganzinger's Ordered Resolution Prover},
  journal = {Archive of Formal Proofs},
  month   = jan,
  year    = 2018,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: Coinductive, Nested_Multisets_Ordinals
Used by: Chandy_Lamport, Functional_Ordered_Resolution_Prover, Saturation_Framework, Saturation_Framework_Extensions
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.