Abstract
We developed a formal framework for CDCL (conflict-driven clause learning) in Isabelle/HOL. Through a chain of refinements, an abstract CDCL calculus is connected to a SAT solver expressed in a functional programming language, with total correctness guarantees. The framework offers a convenient way to prove metatheorems and experiment with variants. Compared with earlier SAT solver verifications, the main novelties are the inclusion of rules for forget, restart, and incremental solving and the application of refinement.
Cite
CITATION STYLE
Blanchette, J. C., Fleury, M., & Weidenbach, C. (2016). A verified SAT solver framework with learn, forget, restart, and incrementality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9706, pp. 25–44). Springer Verlag. https://doi.org/10.1007/978-3-319-40229-1_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
