AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Certified Branch-and-Bound MaxSAT Solving

Dieter Vandesande, Jordi Coll, Bart Bogaerts

AAAI 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 2 citations (OpenAlex)

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 changedWhereMeasuredEffect
add proof logging to MaxCDCLMaxCDCL · MaxSAT Evaluation 2024solving time: median overhead 19%; 10% of instances more than 4.61 times slowerMixed
add proof logging to MaxCDCLMaxCDCL · MaxSAT Evaluation 2024instances solved: six of 701 instances no longer solvedHurt
check produced proofs with VeriPBMaxCDCL proofs · MaxSAT Evaluation 2024proof checking success: 485 of 695 proofs checked; 202 timeouts, 8 out of memoryMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy