![Mathematics / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Constraint satisfaction problem / Solver / Theoretical computer science / Constraint programming / Applied mathematics Mathematics / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Constraint satisfaction problem / Solver / Theoretical computer science / Constraint programming / Applied mathematics](https://www.pdfsearch.io/img/d3295c43f021500e52712f38e07c4d88.jpg) Date: 2007-11-26 20:10:39Mathematics Logic in computer science Electronic design automation Formal methods NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Constraint satisfaction problem Solver Theoretical computer science Constraint programming Applied mathematics | | Don’t care in SMT—Building flexible yet efficient abstraction/refinement solvers1 Andreas Bauer∗ , Martin Leucker∗∗, Christian Schallhart∗∗, Michael Tautschnig∗∗ ∗ ∗∗Add to Reading ListSource URL: www.immerundewig.atDownload Document from Source Website File Size: 138,07 KBShare Document on Facebook
|