First Page | Document Content | |
---|---|---|
![]() Date: 2018-09-27 16:37:21Theoretical computer science Mathematics Computational complexity theory Logic in computer science Electronic design automation Formal methods NP-complete problems Constraint programming Planning Domain Definition Language Boolean satisfiability problem Satisfiability modulo theories Hybrid system | Add to Reading List |
![]() | 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 |