![Theoretical computer science / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Mathematics / Constraint programming / Satisfiability modulo theories / Boolean satisfiability problem / Array data type / Literal / Matrix Theoretical computer science / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Mathematics / Constraint programming / Satisfiability modulo theories / Boolean satisfiability problem / Array data type / Literal / Matrix](https://www.pdfsearch.io/img/b20f28e6f52f2dea4223ed6b8189720d.jpg) Date: 2008-07-14 06:59:10Theoretical computer science Logic in computer science Electronic design automation Formal methods NP-complete problems Mathematics Constraint programming Satisfiability modulo theories Boolean satisfiability problem Array data type Literal Matrix | | A Write-Based Solver for SAT Modulo the Theory of Arrays Miquel Bofill Universitat de Girona Robert NieuwenhuisAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 187,74 KBShare Document on Facebook
|