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.
|Number of pages||27|
|Journal||Journal of Automated Reasoning|
|Early online date||17 Jun 2020|
|Publication status||Published - Oct 2020|
Bibliographical noteSpecial Issue: Selected Extended Papers from IJCAR 2018.
- Automatic theorem provers
- Proof assistants
- Resolution calculus