![Theoretical computer science / Logic in computer science / Computational complexity theory / Formal methods / Mathematics / Electronic design automation / NP-complete problems / Constraint programming / Satisfiability modulo theories / Boolean satisfiability problem / Solver / Model checking Theoretical computer science / Logic in computer science / Computational complexity theory / Formal methods / Mathematics / Electronic design automation / NP-complete problems / Constraint programming / Satisfiability modulo theories / Boolean satisfiability problem / Solver / Model checking](https://www.pdfsearch.io/img/df3c084d64f002faeb6a7dfb52b04071.jpg) Date: 2017-07-30 15:11:06Theoretical computer science Logic in computer science Computational complexity theory Formal methods Mathematics Electronic design automation NP-complete problems Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Model checking | | SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces ´ Erika Abrah´ am1 , John Abbott10 , Bernd Becker2 , Anna M. Bigatti3 , Martin Brain9 , Alessandro Cimatti4 , James H. Davenport5 ,Add to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source Website File Size: 303,28 KBShare Document on Facebook
|