Back to Results
First PageMeta Content
Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Automated theorem proving / NP-complete problems / Electronic design automation / Formal methods / Conflict-driven clause learning / Boolean satisfiability problem / Clause / Unit propagation


A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research
Add to Reading List

Document Date: 2014-06-27 12:47:14

Open Document

File Size: 363,26 KB

Share Result on Facebook