On dedicated CDCL strategies for PB solvers
From MaRDI portal
Publication:2118312
Cites work
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Evaluating CDCL variable scoring schemes
- GRASP: a search algorithm for propositional satisfiability
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
- Learning rate based branching heuristic for SAT solvers
- On the complexity of cutting-plane proofs
- On the power of clause-learning SAT solvers as resolution engines
- On weakening strategies for PB solvers
- Optimal speedup of Las Vegas algorithms
- Outline of an algorithm for integer solutions to linear programs
- The intractability of resolution
- Theory and Applications of Satisfiability Testing
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
This page was built for publication: On dedicated CDCL strategies for PB solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118312)