Abstract
Constraint propagation is a generic method for combining monotone operators over lattices. In this paper, a family of constraint propagation strategies are designed as instances of a single algorithm shown to be correct, finite, and strategy-independent. The main idea is to separate complex reasoning processes (that exploit some knowledge of constraints and solvers in order to accelerate the convergence) from basic fixed-point algorithms. Some sequential interval narrowing strategies are expressed in this framework and parallel implementations in different execution models are discussed.
This research was carried out while Eric Monfroy was visiting IRIN.
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
Krzysztof Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221(1–2):179–210, 1999.
Frédéric Benhamou. Heterogeneous Constraint Solving. In Proceedings of International Conference on Algebraic and Logic Programming, volume 1139 of LNCS, pages 62–76, Aachen, Germany, 1996. Springer.
Frédéric Benhamou, Frédéric Goualard, Laurent Granvilliers, and Jean-François Puget. Revising Hull and Box Consistency. In Proceedings of International Conference on Logic Programming, pages 230–244, Las Cruces, USA, 1999. The MIT Press.
Frédéric Benhamou, David McAllester, and Pascal VanHentenryck. CLP (Intervals) Revisited. In Proc. of International Logic Programming Symposium, 1994.
Frédéric Benhamou and William Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming, 32(1):1–24, 1997.
John Cleary. Logical Arithmetic. Future Computing Systems, 2(2):125–149, 1987.
Laurent Granvilliers. Towards Cooperative Interval Narrowing. In Proceedings of International Workshop on Frontiers of Combining Systems, volume 1794 of LNAI, pages 18–31, Nancy, France, 2000. Springer.
Laurent Granvilliers, Frédéric Goualard, and Frédéric Benhamou. Box Consistency through Weak Box Consistency. In Proceedings of IEEE International Conference on Tools with Artificial Intelligence, pages 373–380, Chicago, USA, 1999. IEEE Computer Society.
Laurent Granvilliers and Gaétan Hains. A Conservative Scheme for Parallel Interval Narrowing. Information Processing Letters, 2000. Forthcoming.
Olivier Lhomme. Consistency Techniques for Numeric CSPs. In Proc. of International Joint Conference on Artificial Intelligence, 1993.
Olivier Lhomme, Arnaud Gotlieb, and Michel Rueher. Dynamic Optimization of Interval Narrowing Algorithms. Journal of Logic Programming, 37(1–2):165–183, 1998.
Alan Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.
Eŕic Monfroy. Using Weaker Functions for Constraint Propagation over Real Numbers. In Proceedings of ACM Symposium of Applied Computing, pages 553–559, San Antonio, USA, 1999.
Eŕic 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ŕic Monfroy and Jean-Hugues Réty. Chaotic Iteration for Distributed Constraint Propagation. In Proceedings of ACM Symposium of Applied Computing, pages 19–24, San Antonio, USA, 1999.
Eŕic Monfroy and Jean-Hugues Réty. Itérations Asynchrones: un Cadre Uniforme pour la Propagation de Contraintes Paralléle et Répartie. In (F. Fages, (editor), Proceedings of Journées Francophones de Programmation Logique et Contrainte, pages 123–137. Hermés, 1999. In French.
Ugo Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95–132, 1974.
Aleksandr Narin’yani. Sub-definiteness and Basic Means of Knowledge Representation. Computers and Artificial Intelligence, 5, 1983.
Leslie Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, pages 103–111, 1990.
Pascal Van Hentenryck, David McAllester, and Deepak Kapur. Solving Polynomial Systems Using a Branch and Prune Approach. SIAM Journal on Numerical Analysis, 34(2):797–827, 1997.
Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: a Modeling Language for Global Optimization. MIT Press, 1997.
David Waltz. Generating Semantic Descriptions from Drawings of Scenes with Shadows. In P. H. Winston, (editor), The Psychology of Computer Vision. McGraw Hill, 1975.
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
Granvilliers, L., Monfroy, E. (2000). Declarative Modelling of Constraint Propagation Strategies. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2000. Lecture Notes in Computer Science, vol 1909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40888-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-40888-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41184-0
Online ISBN: 978-3-540-40888-8
eBook Packages: Springer Book Archive