A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Best Sister Conferences. Pages 4786-4790. https://doi.org/10.24963/ijcai.2017/667

We developed a formal framework for SAT solving using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL (conflict-driven clause learning) calculus is connected to a SAT solver that always terminates with correct answers. The framework offers a convenient way to prove theorems about the SAT solver and experiment with variants of the calculus. Compared with earlier verifications, the main novelties are the inclusion of the CDCL rules for forget, restart, and incremental solving and the use of refinement.
Keywords:
Artificial Intelligence: artificial intelligence
Artificial Intelligence: knowledge representation and reasoning