![Theoretical computer science / Mathematics / Mathematical logic / Logic in computer science / Automated theorem proving / Electronic design automation / Formal methods / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Substitution / Model theory Theoretical computer science / Mathematics / Mathematical logic / Logic in computer science / Automated theorem proving / Electronic design automation / Formal methods / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Substitution / Model theory](https://www.pdfsearch.io/img/8a53c7ac9eb958e7d585347751917144.jpg) Date: 2018-04-25 11:34:43Theoretical computer science Mathematics Mathematical logic Logic in computer science Automated theorem proving Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Substitution Model theory | | Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 Jovanovi´c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford UniAdd to Reading ListSource URL: csl.sri.comDownload Document from Source Website File Size: 334,94 KBShare Document on Facebook
|