1378 search results - page 22 / 276 » The Tractability of Global Constraints |
127
click to vote
CORR
2010
Springer
15 years 14 days ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
110
click to vote
ECAI
2010
Springer
15 years 14 days ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
117
click to vote
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
CPAIOR
2004
Springer
15 years 7 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
102
click to vote
CPAIOR
2005
Springer
15 years 7 months ago
2005
Springer
We propose a natural generalization of arc-consistency, which we call multiconsistency: A value v in the domain of a variable x is kmulticonsistent with respect to a constraint C i...