Distributed Splitting of Constraint Satisfaction Problems
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  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 of variables can be dynamically triggered before the fixed point of a propagation is reached.
KeywordsConstraint Satisfaction Problem Input Port Constraint Propagation Termination Agent Search Agent
Unable to display preview. Download preview PDF.
- 1.K. R. Apt. Component-based framework for constraint programming. Manuscript, 1999.Google Scholar
- 3.K. R. Apt. The Rough Guide to Constraint Propagation”. In J. Jaffar, editor, Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP’99), volume 1713 of Lecture Notes in Computer Science, pages 1–23. Springer-Verlag, 1999. Invited lecture.Google Scholar
- 4.K. R. Apt and E. Monfroy. Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. In J. Jaffar, editor, Proceedings of Fifth International Conference on Principles and Practice of Constraint Programming, CP’99, volume 1713 of Lecture Notes in Computer Science, pages 58–72, Alexandria, Virginia, USA, October 1999.Google Scholar
- 7.F. Arbab. Manifold2.0 reference manual. CWI, Amsterdam, The Netherlands, May 1997.Google Scholar
- 8.F. Benhamou and W. Older. Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming, 32(1):1–24, March 1997.Google Scholar
- 10.L. Granvilliers. Résolution approchée de contraintes réelles par transformations symboliques et consistance de bloc. Technique et Science Informatiques, 18(2):209–232, 1999.Google Scholar
- 12.E. Monfroy. Using “Weaker” Functions for Constraint Propagation over Real Numb ers. In J. Carroll, H. Haddad, D. Oppenheim, B. Bryant, and G. Lamont, editors, Proceedings of The 14th ACM Symposium on Applied Computing, ACM SAC’99, Scientific Computing Track, pages 553–559, San Antonio, Texas, USA, March 1999.Google Scholar
- 13.E. Monfroy. A Coordination-based Chaotic Iteration Algorithm for Constraint Propagation. In J. Carroll, E. Damiani, H. Haddad, and D. Oppenheim, editors, Proceedings of the 2000 ACM Symposium on Applied Computing (SAC’2000), pages 262–269, Villa Olmo, Como, Italy, March 2000. ACM Press.Google Scholar
- 14.E. Monfroy and F. Arbab. Constraints Solving as the Coordination of Inference Engines, chapter in “Coordination of Internet Agents: Models, Technologies, and Applications”. Springer-Verlag, 2000. To appear.Google Scholar