First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 121,41 KBShare Document on Facebook |
1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)DocID: 1ukgD - View Document | |
On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID LisbonDocID: 1rsZm - View Document | |
Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:DocID: 1roWY - View Document | |
A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby MartinDocID: 1rd10 - View Document | |
Microsoft PowerPoint - perspCompatibility Mode]DocID: 1r0cq - View Document |