Sciweavers

1378 search results - page 1 / 276
» The Tractability of Global Constraints
Sort
View
CP
2004
Springer
13 years 10 months ago
The Tractability of Global Constraints
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...
Christian Bessière, Emmanuel Hebrard, Brahi...
CATS
2008
13 years 6 months ago
Tractable Cases of the Extended Global Cardinality Constraint
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...
Marko Samer, Stefan Szeider
AAAI
2004
13 years 6 months ago
Tractable Tree Convex Constraint Networks
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 ...
Yuanlin Zhang, Eugene C. Freuder
CSCLP
2007
Springer
13 years 11 months ago
Generalizing Global Constraints Based on Network Flows
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 ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
AAAI
2008
13 years 7 months ago
The Parameterized Complexity of Global Constraints
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...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...