![Theoretical computer science / Logic / Logic in computer science / Mathematics / Electronic design automation / Formal methods / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Uninterpreted function / Satisfiability / Solver Theoretical computer science / Logic / Logic in computer science / Mathematics / Electronic design automation / Formal methods / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Uninterpreted function / Satisfiability / Solver](https://www.pdfsearch.io/img/94297c6d9f55c2eedf3dfa5808739469.jpg) Date: 2017-08-06 07:51:38Theoretical computer science Logic Logic in computer science Mathematics Electronic design automation Formal methods NP-complete problems Boolean algebra Boolean satisfiability problem Uninterpreted function Satisfiability Solver | | SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, FoAdd to Reading ListSource URL: staff.bath.ac.ukDownload Document from Source Website File Size: 148,96 KBShare Document on Facebook
|