Name
Abstract | ||
|---|---|---|
Constraint satisfaction problems (CSP) or Boolean satisfiability problem (SAT) are two well known paradigm to model and solve combinatorial problems. Modeling and resolution of CSP is often strengthened by global constraints (e.g., Alldiff constraint). This paper highlights two different ways of handling specific structural information: a uniform propagation framework to handle (interleaved) Alldiff constraints with some CSP reduction rules; and a SAT encoding of these rules that preserves the reduction properties of CSP. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-05258-3_32 | MICAI |
Keywords | Field | DocType |
different way,reduction property,constraint satisfaction problem,alldiff constraint,interconnected alldiff constraints,csp reduction,combinatorial problem,specific structural information,sat encoding,global constraint,csp reduction rule,boolean satisfiability problem,boolean satisfiability | Mathematical optimization,Computer science,Boolean satisfiability problem,Constraint satisfaction problem,Constraint satisfaction dual problem,Encoding (memory) | Conference |
Volume | ISSN | Citations |
5845 | 0302-9743 | 4 |
PageRank | References | Authors |
0.43 | 18 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederic Lardeux | 1 | 6 | 1.16 |
| Eric Monfroy | 2 | 579 | 63.05 |
| Frederic Saubion | 3 | 35 | 3.97 |
| Broderick Crawford | 4 | 446 | 73.74 |
| Carlos Castro | 5 | 255 | 29.05 |