![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 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](https://www.pdfsearch.io/img/e1586a1b97ba6e768e9ef53a61aa166f.jpg) Date: 2014-06-27 12:47:14Theoretical 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 ResearchAdd to Reading ListSource URL: csl.sri.comDownload Document from Source Website File Size: 363,26 KBShare Document on Facebook
|