On dedicated CDCL strategies for PB solvers
DOI10.1007/978-3-030-80223-3_22OpenAlexW3186193063MaRDI QIDQ2118312FDOQ2118312
Romain Wallon, Daniel Le Berre
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2109.01013
pseudo-Boolean optimizationbranching heuristicslearned constraint deletion strategiespseudo-Boolean solvingrestart policies
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Outline of an algorithm for integer solutions to linear programs
- GRASP: a search algorithm for propositional satisfiability
- Optimal speedup of Las Vegas algorithms
- On the complexity of cutting-plane proofs
- The intractability of resolution
- On the power of clause-learning SAT solvers as resolution engines
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Evaluating CDCL Variable Scoring Schemes
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Learning Rate Based Branching Heuristic for SAT Solvers
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
- On weakening strategies for PB solvers
Uses Software
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)
