285 search results - page 7 / 57 » The complexity of soft constraint satisfaction |
COCO
2004
Springer
14 years 4 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
CP
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
CPAIOR
2006
Springer
14 years 25 days ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
ACMICEC
2006
ACM
14 years 4 months ago
2006
ACM
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...