Abstract
This Isabelle/HOL formalization refines the abstract ordered
resolution prover presented in Section 4.3 of Bachmair and
Ganzinger's "Resolution Theorem Proving" chapter in the
Handbook of Automated Reasoning. The result is a
functional implementation of a first-order prover.
License
Topics
Session Functional_Ordered_Resolution_Prover
- Weighted_FO_Ordered_Resolution_Prover
- Deterministic_FO_Ordered_Resolution_Prover
- IsaFoR_Term
- Executable_Subsumption
- Executable_FO_Ordered_Resolution_Prover
Depends on
- First-Order Terms
- A Formalization of Knuth–Bendix Orders
- Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms
- Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals
- Open Induction
- Formalization of Bachmair and Ganzinger’s Ordered Resolution Prover
- Polynomial Factorization