First Page | Document Content | |
---|---|---|
![]() Date: 2018-07-19 05:32:19Theoretical computer science Logic in computer science Automated theorem proving Formal methods Constraint programming Logic programming Resolution Unification Satisfiability modulo theories Andrei Voronkov | Add to Reading List |
![]() | 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 |