Date: 2008-04-24 09:03:36Theoretical computer science Mathematics Computational complexity theory Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Solver Maximum satisfiability problem | | The Barcelogic SMT Solver (Tool Paper)? Miquel Bofill† , Robert Nieuwenhuis? , Albert Oliveras? , Enric Rodr´ıguez-Carbonell? and Albert Rubio? †Add to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 121,41 KBShare Document on Facebook
|