43 search results - page 2 / 9 » A unified theory of structural tractability for constraint s... |
STACS
2009
Springer
13 years 11 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...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
CORR
2010
Springer
13 years 5 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...
ECAI
2008
Springer
13 years 6 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...
CSL
2003
Springer
13 years 10 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...