1051 search results - page 28 / 211 » Foundations of Constraint Satisfaction |
CP
1999
Springer
15 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
STACS
2009
Springer
15 years 4 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...
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
107
click to vote
AI
2008
Springer
14 years 10 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...