Formalization of Bachmair and Ganzinger's Ordered Resolution Prover (Q7361268)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Ordered_Resolution_Prover
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formalization of Bachmair and Ganzinger's Ordered Resolution Prover |
AFP entry Ordered_Resolution_Prover |
Statements
18 January 2018
0 references
Anders Schlichtkrull
0 references
Jasmin Christian Blanchette
0 references
Dmitriy Traytel
0 references
Uwe Waldmann
0 references
Formalization of Bachmair and Ganzinger's Ordered Resolution Prover (English)
0 references
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.
0 references
