Limitations of Restricted Branching in Clause Learning
From MaRDI portal
Recommendations
- Limitations of restricted branching in clause learning
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
- scientific article; zbMATH DE number 2243370
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Formal Methods in Computer-Aided Design
- GRASP: a search algorithm for propositional satisfiability
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1796153 (Why is no real title available?)
- scientific article; zbMATH DE number 1931668 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Limitations of Restricted Branching in Clause Learning
- Regular Resolution Versus Unrestricted Resolution
- The Complexity of Propositional Proofs
- The intractability of resolution
- The relative efficiency of propositional proof systems
- Theory and Applications of Satisfiability Testing
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
Cited in
(3)
This page was built for publication: Limitations of Restricted Branching in Clause Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523067)