![Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Conflict-driven clause learning / Satisfiability modulo theories / Unit propagation Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Conflict-driven clause learning / Satisfiability modulo theories / Unit propagation](https://www.pdfsearch.io/img/6e68a4d708e863312688e3d77fc69ce3.jpg) Date: 2014-06-27 12:47:14Theoretical computer science Computational complexity theory Mathematics Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Conflict-driven clause learning Satisfiability modulo theories Unit propagation | | The Design and Implementation of the Model Constructing Satisfiability Calculus Dejan JovanoviĀ“c Clark BarrettAdd to Reading ListSource URL: csl.sri.comDownload Document from Source Website File Size: 398,43 KBShare Document on Facebook
|