Skip to main content
SpringerLink
Log in
Book cover

International Conference on Advances in Information Systems

ADVIS 2000: Advances in Information Systems pp 201–215Cite as

Declarative Modelling of Constraint Propagation Strategies

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1909))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Krzysztof Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221(1–2):179–210, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  2. 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.

    Chapter  Google Scholar 

  3. 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.

    Google Scholar 

  4. Frédéric Benhamou, David McAllester, and Pascal VanHentenryck. CLP (Intervals) Revisited. In Proc. of International Logic Programming Symposium, 1994.

    Google Scholar 

  5. 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.

    Article  MathSciNet  MATH  Google Scholar 

  6. John Cleary. Logical Arithmetic. Future Computing Systems, 2(2):125–149, 1987.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Laurent Granvilliers and Gaétan Hains. A Conservative Scheme for Parallel Interval Narrowing. Information Processing Letters, 2000. Forthcoming.

    Google Scholar 

  10. Olivier Lhomme. Consistency Techniques for Numeric CSPs. In Proc. of International Joint Conference on Artificial Intelligence, 1993.

    Google Scholar 

  11. Olivier Lhomme, Arnaud Gotlieb, and Michel Rueher. Dynamic Optimization of Interval Narrowing Algorithms. Journal of Logic Programming, 37(1–2):165–183, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  12. Alan Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. 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.

    Google Scholar 

  17. Ugo Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95–132, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  18. Aleksandr Narin’yani. Sub-definiteness and Basic Means of Knowledge Representation. Computers and Artificial Intelligence, 5, 1983.

    Google Scholar 

  19. Leslie Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, pages 103–111, 1990.

    Google Scholar 

  20. 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.

    Article  MathSciNet  MATH  Google Scholar 

  21. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: a Modeling Language for Global Optimization. MIT Press, 1997.

    Google Scholar 

  22. David Waltz. Generating Semantic Descriptions from Drawings of Scenes with Shadows. In P. H. Winston, (editor), The Psychology of Computer Vision. McGraw Hill, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIN, B.P. 92208, F-44322 Nantes Cedex 3, France

    Laurent Granvilliers

  2. CWI, Kruislaan 413, 1098 SJ, Amsterdam, the Netherlands

    Eric Monfroy

Authors
  1. Laurent Granvilliers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eric Monfroy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Engineering Department, Dokuz Eylul University, Bornova, 35100, Izmir, Turkey

    Tatyana Yakhno

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation