Using “weaker” functions for constraint propagation over real numbers
Proceedings of the 1999 ACM symposium on Applied computing
The essence of constraint propagation
Theoretical Computer Science
A coordination-based chaotic iteration algorithm for constraint propagation
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Constraints solving as the coordination of inference engines
Coordination of Internet agents
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
The Rough Guide to Constraint Propagation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Coordination of massively concurrent activities
Coordination of massively concurrent activities
A Framework for Coordinating Parallel Branch and Bound Algorithms
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
| Hi-index | 0.00 |
Constraint propagation aims to reduce a constraint satisfaction problem into an equivalent but simpler one. However, constraint propagation must be interleaved with a splitting mechanism in order to compose a complete solver. In [13] a framework for constraint propagation based on a control-driven coordination model was presented. In this paper we extend this framework in order to integrate a distributed splitting mechanism. This technique has three main advantages: 1) in a single distributed and generic framework, propagation and splitting can be interleaved in order to realize complete distributed solvers, 2) by changing only one agent, we can perform different kinds of search, and 3) splitting ofv ariables can be dynamically triggered before the fixed point ofa propagation is reached.