Name
Abstract | ||
|---|---|---|
The weighted constraint satisfaction problem (WCSP) is a soft constraint framework with a wide range of applications. Most current complete solvers can be described as a depth-first branch and bound search that maintains some form of local consistency during the search. However, the known consistencies are unable to solve problems with huge domains because of their time and space complexities. In this paper, we adapt the 2B-consistency, a weaker form of arc consistency well-known in classic CSPs, into the bound arc consistency and we provide several algorithms to enforce it. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1141277.1141367 | SAC |
Keywords | Field | DocType |
soft constraint framework,local consistency,arc consistency well-known,weaker form,weighted constraint satisfaction problem,long domain,new local consistency,weighted csp,known consistency,classic csps,bound arc consistency,current complete solvers,bound search,constraint satisfaction problem,branch and bound,space complexity,arc consistency | Mathematical optimization,Local consistency,Sequential consistency,Computer science,Constraint satisfaction problem,Constraint satisfaction dual problem,Weak consistency,Consistency model,Constraint logic programming,Strong consistency | Conference |
ISBN | Citations | PageRank |
1-59593-108-2 | 6 | 0.57 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Zytnicki | 1 | 166 | 8.92 |
| Christine Gaspin | 2 | 54 | 7.68 |
| Thomas Schiex | 3 | 1509 | 123.12 |