Metadata only
Datum
2020-10Typ
- Journal Article
Abstract
We present an Isabelle/HOL formalization of the first half of Bachmair and Ganzinger's chapter on resolution theorem proving, culminating with a refutationally complete first-order prover based on ordered resolution with literal selection. We developed general infrastructure and methodology that can form the basis of completeness proofs for related calculi, including superposition. Our work clarifies fine points in the chapter, emphasizing the value of formal proofs in the field of automated reasoning. (© 2020 Springer). Mehr anzeigen
Publikationsstatus
publishedExterne Links
Zeitschrift / Serie
Journal of Automated ReasoningBand
Seiten / Artikelnummer
Verlag
SpringerThema
Resolution calculus; Automatic theorem provers; Proof assistants