The Completeness of Propositional Resolution: A Simple and Constructive Proof
From MaRDI portal
Recommendations
Cited in
(18)- A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic
- Generalized resolution and NC-resolution
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- A brief proof of the full completeness of Shin's Venn diagram proof system
- Simple characterization of functionally complete one-element sets of propositional connectives
- scientific article; zbMATH DE number 8781 (Why is no real title available?)
- scientific article; zbMATH DE number 1090101 (Why is no real title available?)
- Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution
- scientific article; zbMATH DE number 1507189 (Why is no real title available?)
- scientific article; zbMATH DE number 2094813 (Why is no real title available?)
- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- Extracting the resolution algorithm from a completeness proof for the propositional calculus
- General clauses for SAT-based proof search in intuitionistic propositional logic
- Linearity and regularity with negation normal form
- Completeness of resolution revisited
- Existence of simple propositional formulas
- A simplification of the completeness proofs for Guaspari and Solovay's R
This page was built for publication: The Completeness of Propositional Resolution: A Simple and Constructive Proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310674)
