Sciweavers

1381 search results - page 12 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
ECAI
2004
Springer
14 years 3 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
IJCAI
1989
13 years 10 months ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain
CSL
2006
Springer
14 years 1 months ago
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
Manuel Bodirsky, Hubie Chen
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 3 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
IJCAI
1989
13 years 10 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey