Date: 2006-04-28 13:17:24Theoretical computer science Mathematics Mathematical logic Logic in computer science Automated theorem proving Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Maximum satisfiability problem Unit propagation | | On SAT Modulo Theories and Optimization Problems Robert Nieuwenhuis and Albert Oliveras? Abstract. Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verificatiAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 162,01 KBShare Document on Facebook
|