<--- Back to Details
First PageDocument Content
Theoretical computer science / Logic in computer science / Combinatorial optimization / Maximum satisfiability problem / Unit propagation / Constraint programming / Mathematics / Mathematical logic
Date: 2012-12-16 04:54:55
Theoretical computer science
Logic in computer science
Combinatorial optimization
Maximum satisfiability problem
Unit propagation
Constraint programming
Mathematics
Mathematical logic

Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2

Add to Reading List

Source URL: www.mancoosi.org

Download Document from Source Website

File Size: 115,78 KB

Share Document on Facebook

Similar Documents

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

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

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

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

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