CP
2005
Springer
14 years 5 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
SSD
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
CP
2007
Springer
14 years 5 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
CEC
2007
IEEE
14 years 5 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
LICS
2008
IEEE
14 years 6 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...