The complexity of resolution refinements

DOI10.2178/jsl/1203350790zbMath1160.03005OpenAlexW2015878287MaRDI QIDQ5444704

Joshua Buresh-Oppenheim, Toniann Pitassi

Publication date: 25 February 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1203350790

zbMATH Keywords

complexityresolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (4)

Solving satisfiability problems with preferences ⋮ Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable ⋮ Unnamed Item ⋮ On Linear Resolution

Cites Work

• The intractability of resolution
• Unrestricted resolution versus N-resolution
• Davis-Putnam resolution versus unrestricted resolution
• Linear resolution with selection function
• On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
• Regular Resolution Versus Unrestricted Resolution
• The Complexity of Propositional Proofs
• A Machine-Oriented Logic Based on the Resolution Principle
• A machine program for theorem-proving

This page was built for publication: The complexity of resolution refinements