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

Abstract : 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.
Type de document :
Communication dans un congrès
Carles Sierra. 26th International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.4786-4790, 〈10.24963/ijcai.2017/667〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01592164
Contributeur : Stephan Merz <>
Soumis le : vendredi 22 septembre 2017 - 17:14:37
Dernière modification le : jeudi 20 septembre 2018 - 07:54:02
Document(s) archivé(s) le : samedi 23 décembre 2017 - 14:21:44

Fichier

BlanchetteFleuryWeidenbachIJCA...
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Jasmin Blanchette, Mathias Fleury, Christoph Weidenbach. A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. Carles Sierra. 26th International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.4786-4790, 〈10.24963/ijcai.2017/667〉. 〈hal-01592164〉

Partager

Métriques

Consultations de la notice

302

Téléchargements de fichiers

14