Back to Results
First PageMeta Content
Formal methods / Automated theorem proving / Logic in computer science / Boolean algebra / Electronic design automation / Conflict-Driven Clause Learning / Boolean satisfiability problem / Satisfiability modulo theories / Clause / Vampire / Propositional calculus / Lambda calculus


A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Jasmin Christian Blanchette1,2 , Mathias Fleury2 , and Christoph Weidenbach2 1 2
Add to Reading List

Document Date: 2016-06-17 09:50:06

Open Document

File Size: 189,65 KB

Share Result on Facebook
UPDATE