First Page | Document Content | |
---|---|---|
Date: 2009-09-10 10:56:53Theoretical computer science Logic Mathematics Formal methods Logic in computer science Boolean algebra Electronic design automation NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Solver Propositional calculus | Introduction SAT Solvers Satisfiability Modulo Theories Conclusions Integrating SAT and SMT SolversAdd to Reading ListSource URL: user.it.uu.seDownload Document from Source WebsiteFile Size: 663,47 KBShare Document on Facebook |