Regular Resolution Versus Unrestricted Resolution
From MaRDI portal
Recommendations
- Davis-Putnam resolution versus unrestricted resolution
- Unrestricted resolution versus N-resolution
- scientific article; zbMATH DE number 4210103
- The complexity of Gentzen systems for propositional logic
- Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
- scientific article; zbMATH DE number 3849198
- Optimality of size-width tradeoffs for resolution
- On the complexity of propositional calculus formulae
- Short proofs are narrow—resolution made simple
- Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution
Cited in
(13)- Regular resolution effectively simulates resolution
- Characterizing Tseitin-formulas with short regular resolution refutations
- Reflections on Proof Complexity and Counting Principles
- Unrestricted resolution versus N-resolution
- Limitations of restricted branching in clause learning
- scientific article; zbMATH DE number 4072434 (Why is no real title available?)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK
- Regular and General Resolution: An Improved Separation
- The complexity of resolution refinements
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
- The NP-hardness of finding a directed acyclic graph for regular resolution
- Resolution decision procedures
- Limitations of Restricted Branching in Clause Learning
This page was built for publication: Regular Resolution Versus Unrestricted Resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137703)
