First Page | Document Content | |
---|---|---|
Date: 2014-06-27 12:47:14Theoretical computer science Computational complexity theory Mathematics Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Conflict-driven clause learning Satisfiability modulo theories Unit propagation | The Design and Implementation of the Model Constructing Satisfiability Calculus Dejan JovanoviĀ“c Clark BarrettAdd to Reading ListSource URL: csl.sri.comDownload Document from Source WebsiteFile Size: 398,43 KBShare Document on Facebook |
Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin PearsonDocID: 1xUdh - View Document | |
PDF DocumentDocID: 1xSrV - View Document | |
Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard BrewkaDocID: 1vleR - View Document | |
Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995DocID: 1v7SC - View Document | |
Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, BeDocID: 1v72L - View Document |