351 search results - page 3 / 71 » Perfect Constraints Are Tractable |
KR
2010
Springer
13 years 10 months ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
AAAI
2004
13 years 7 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 ...
JCSS
2008
13 years 5 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
IJCAI
2003
13 years 7 months ago
2003
In many applications of temporal reasoning we are in terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
STACS
2009
Springer
14 years 16 days ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...