First Page | Document Content | |
---|---|---|
Date: 2007-03-14 18:49:09Operations research Constraint programming Logic in computer science Electronic design automation Formal methods Satisfiability Modulo Theories Solver Boolean satisfiability problem Constraint satisfaction Theoretical computer science Applied mathematics Mathematics | Tool-Support for the Analysis of Hybrid Systems and ModelsAdd to Reading ListSource URL: www.date-conference.comDownload Document from Source WebsiteFile Size: 236,82 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 |