z-logo
open-access-imgOpen Access
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Extended Abstract)
Author(s) -
Jasmin Christian Blanchette,
Mathias Fleury,
Christoph Weidenbach
Publication year - 2016
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - correctness , hol , computer science , solver , programming language , boolean satisfiability problem , proof assistant , theoretical computer science , algorithm , mathematics , geometry , mathematical proof

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here