Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014

First Page		Document Content
Date: 2014-07-21 06:41:07 Theoretical computer science Mathematics Computational complexity theory Logic in computer science NP-complete problems Electronic design automation Formal methods Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Automated reasoning		Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014 Add to Reading List Source URL: smt2014.it.uu.se Download Document from Source Website File Size: 507,51 KB Share Document on Facebook

	Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson DocID: 1xUdh - View Document
	PDF Document DocID: 1xSrV - View Document
	Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka DocID: 1vleR - View Document
	Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995 DocID: 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, Be DocID: 1v72L - View Document