1378 search results - page 6 / 276 » The Tractability of Global Constraints |
HEURISTICS
2006
13 years 7 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
JCSS
2008
13 years 7 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 8 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 2 months 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...
JAPLL
2010
13 years 5 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...