Numeric Bounds Analysis with Conflict-Driven Learning? Vijay D’Silva?? , Leopold Haller, Daniel Kroening, and Michael Tautschnig Computer Science Department, University of Oxford

First Page		Document Content
Date: 2012-07-25 13:39:19 Applied mathematics Electronic design automation Formal methods Logic in computer science NP-complete problems Valuation Boolean satisfiability problem Local consistency Abstract interpretation Theoretical computer science Constraint programming Mathematics		Numeric Bounds Analysis with Conflict-Driven Learning? Vijay D’Silva?? , Leopold Haller, Daniel Kroening, and Michael Tautschnig Computer Science Department, University of Oxford Add to Reading List Source URL: www.cs.ox.ac.uk Download Document from Source Website File Size: 412,65 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