1378 search results - page 1 / 276 » The Tractability of Global Constraints |
72
Voted
CP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
CATS
2008
15 years 11 days ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
92
Voted
AAAI
2004
15 years 10 days ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
71
Voted
CSCLP
2007
Springer
15 years 5 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
89
Voted
AAAI
2008
15 years 1 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...