Research map / Learning theory and algorithms / Combinatorial and search optimization
Certified Branch-and-Bound MaxSAT Solving
Dieter Vandesande, Jordi Coll, Bart Bogaerts
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add proof logging to MaxCDCL | MaxCDCL · MaxSAT Evaluation 2024 | solving time: median overhead 19%; 10% of instances more than 4.61 times slower | Mixed |
| add proof logging to MaxCDCL | MaxCDCL · MaxSAT Evaluation 2024 | instances solved: six of 701 instances no longer solved | Hurt |
| check produced proofs with VeriPB | MaxCDCL proofs · MaxSAT Evaluation 2024 | proof checking success: 485 of 695 proofs checked; 202 timeouts, 8 out of memory | Mixed |
Closest papers by meaning
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.90)
- Ordered Objectives in Maximum Satisfiability (AAAI 2026 · similarity 0.89)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.87)
- Certifying Bounds Propagation for Integer Multiplication Constraints (AAAI 2025 · similarity 0.86)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.86)
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
