Abstract
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 of variables can be dynamically triggered before the fixed point of a propagation is reached.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. R. Apt. Component-based framework for constraint programming. Manuscript, 1999.
K. R. Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221(1–2):179–210, 1999.
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.
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.
F. Arbab. Coordination of massively concurrent activities. Technical Report CSR9565, CWI, Amsterdam, The Netherlands, November 1995. Available on-line http://www.cwi.nl/ftp/CWIreports/IS/CS-R9565.ps.Z.
F. Arbab. The IWIM model for coordination of concurrent activities. In Paolo Ciancarini and Chris Hankin, editors, Coordination Languages and Models, volume 1061 of Lecture Notes in Computer Science, pages 34–56. Springer-Verlag, 1996.
F. Arbab. Manifold2.0 reference manual. CWI, Amsterdam, The Netherlands, May 1997.
F. Benhamou and W. Older. Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming, 32(1):1–24, March 1997.
P. Codognet and D. Diaz. A simple and efficient Boolean constraint solver for constraint logic programming. Journal of Automated Reasoning, 17(1):97–128, 1996.
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.
O. Lhomme, A. Gotlieb, and M. Rueher. Dynamic Optimization of Interval Narrowing Algorithms. Journal of Logic Programming, 37(1–2):165–183, 1998.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arbab, F., Monfroy, E. (2000). Distributed Splitting of Constraint Satisfaction Problems. In: Porto, A., Roman, GC. (eds) Coordination Languages and Models. COORDINATION 2000. Lecture Notes in Computer Science, vol 1906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45263-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-45263-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41020-1
Online ISBN: 978-3-540-45263-8
eBook Packages: Springer Book Archive