285 search results - page 8 / 57 » The complexity of soft constraint satisfaction |
AI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
IJCAI
1997
14 years 10 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...