46 search results - page 1 / 10 » Hybrid tractability of valued constraint problems |
AI
2011
Springer
14 years 8 months ago
2011
Springer
103
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
90
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
101
Voted
CATS
2008
15 years 2 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...
121
Voted
AAAI
2004
15 years 2 months 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 ...