180 search results - page 29 / 36 » Complexity of Homogeneous Co-Boolean Constraint Satisfaction... |
SAC
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
AAAI
2000
13 years 9 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
AAAI
2006
13 years 9 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...