405 search results - page 30 / 81 » On the Complexity of Global Constraint Satisfaction |
150
click to vote
FLAIRS
2003
15 years 7 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
146
click to vote
CATS
2008
15 years 7 months 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...
197
click to vote
WETICE
1996
IEEE
15 years 10 months ago
1996
IEEE
Communication and coordination play an important role in achieving concurrency in the design of large complex artifacts. It is also widely accepted that design is constraint orien...
217
click to vote
CSCLP
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
174
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...