In this paper we present several basic techniques for achieving parallel execution of constraint networks. The major result supported by our investigations ...
In this section we summarize our knowledge of the parallel complexity of computing local consistency in constraint satisfaction problems. The results appear ...
[PDF] Local Consistency in Parallel Constraint-Satisfaction Networks
citeseerx.ist.psu.edu › document
Abstract. We summarize our work on the parallel complexity of local consistency in constraint networks, and present several basic techniques for achieving ...
In this paper we present several basic techniques for achieving parallel execution of constraint networks. The major result supported by our investigations ...
Dasygenis MStergiou K(2016)Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local ConsistenciesProceedings of the 9th Hellenic ...
People also ask
What is local consistency in CSP constraint propagation?
Why is consistency important in constraint satisfaction problems?
What is parallel constraint satisfaction theory?
What are the different types of local consistency in AI?
A constraint network is arc consistent if any value of any of its variables is compatible with at least one value of any other variable. The Arc Consistency ...
Bibliographic details on Local Consistency in Parallel Constraint-Satisfaction Networks.
Analysis of local consistency in parallel constraint satisfaction networks. In Proc. AAAI Symposium on Constraint Based Reasoning,. Stanford, pages 154 { 163 ...
Network Consistency Algorithms for Constraint Satisfaction Problems, Artificial. Intelligence 25(1):65-74 (January 1985). 2. Roger Mohr and Thomas C ...
It is known that local consistency algorithms such as arc-, path- and k-consistency are not efficiently parallelizable. Their inherent sequential nature is ...