Skip to main content
SpringerLink
Log in

Propagation Completeness of Reactive Constraints

  • Conference paper
  • First Online:
Logic Programming (ICLP 2002)

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

Included in the following conference series:

Abstract

We develop a framework for addressing correctness and time-liness-of-propagation issues for reactive constraints — global constraints or user-defined constraints that are implemented through constraint propagation. The notion of propagation completeness is introduced to capture timeliness of constraint propagation. A generalized form of arc-consistency is formulated which unifies many local consistency conditions in the literature. We show that propagation complete implementations of reactive constraints achieve this arc-consistency when propagation qui-esces. Finally, we use the framework to state and prove an impossibility result: that CHR cannot implement a common relation with a desirable degree of timely constraint propagation.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abdennadher, Operational semantics and confluence of constraint propagation rules, Proc. Int. Conf. on Principles and Practice of Constraint Programming, LNCS 1330, 252–265, 1997.

    Chapter  Google Scholar 

  2. K. R. Apt & E. Monfroy, Constraint Programming viewed as Rule-based Programming, Theory and Practice of Logic Programming 1(6), 713–750, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Beldiceanu & E. Contejean, Introducing Global Constraints in CHIP, Mathematical Computer Modelling 20(12), 97–123, 1994.

    Article  MATH  Google Scholar 

  4. F. Benhamou, F. Goualard, L. Granvilliers & J.-F. Puget, Revising Hull and Box Consistency, International Conference on Logic Programming, 230–244, 1999.

    Google Scholar 

  5. F. Benhamou, D. A. McAllester & P. Van Hentenryck, CLP (Intervals) Revisited, International Symposium on Logic Programming, 124–138, 1994.

    Google Scholar 

  6. F. Benhamou & W. J. Older, Applying Interval Arithmetic to Real, Integer, and Boolean Constraints. Journal of Logic Programming 32(1): 1–24 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  7. F. S. de Boer, M. Gabbrielli, E. Marchiori & C. Palamidessi, Proving Concurrent Constraint Programs Correct, ACM Transactions on Programming Languages and Systems 19(5): 685–725 (1997).

    Article  Google Scholar 

  8. F. S. de Boer & C. Palamidessi, From Concurrent Logic Programming to Concurrent Constraint Programming, in: Advances in Logic Programming Theory, Oxford University Press, 1993.

    Google Scholar 

  9. B. Carlson, M. Carlsson & S. Janson, The Implementation of AKL(FD), International Symposium on Logic Programming, 227–241, 1995.

    Google Scholar 

  10. P. Codognet & D. Diaz, Compiling Constraints in clp(FD), J. Logic Programming 27(3): 185–226 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Colmerauer, Solving the Multiplication Constraint in Several Approximation Spaces, International Conference on Logic Programming, 1, 2001.

    Google Scholar 

  12. M. Dincbas, P. Van Hentenryck, H. Simonis, & A. Aggoun, The Constraint Logic Programming Language CHIP, Proceedings of the 2nd. International Conference on Fifth Generation Computer Systems, 249–264, 1988.

    Google Scholar 

  13. T. W. Frühwirth, Theory and Practice of Constraint Handling Rules, Journal of Logic Programming 37(1–3): 95–138 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  14. T. Frühwirth, personal communication, 2000.

    Google Scholar 

  15. W. Harvey & P. J. Stuckey, Constraint Representation for Propagation, Proc. Conf. on Principles and Practice of Constraint Programming, 235–249, 1998.

    Google Scholar 

  16. J. Jaffar & J.-L. Lassez, Constraint Logic Programming, Proc. 14th ACM Symposium on Principles of Programming Languages, 111–119, 1987.

    Google Scholar 

  17. J. Jaffar & M. J. Maher, Constraint Logic Programming: A Survey, Journal of Logic Programming 19 & 20, 503–581, 1994.

    Google Scholar 

  18. J. Jaffar, M. J. Maher, K. Marriott & P. J. Stuckey, The Semantics of Constraint Logic Programs, Journal of Logic Programming 37(1–3): 1–46 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Jaffar, M. J. Maher, P. J. Stuckey & R. H. C. Yap, Beyond Finite Domains, Proc. Principles and Practice of Constraint Programming, LNCS 874, 86–94, 1994.

    Google Scholar 

  20. J. Jaffar, S. Michaylov, P. Stuckey & R. H. C. Yap, The CLP(0R) Language and System, ACM Transactions on Programming Languages, 14(3), 339–395, 1992.

    Article  Google Scholar 

  21. J. Jaffar, S. Michaylov & R. H. C. Yap, A Methodology for Managing Hard Constraints in CLP Systems, Proc. ACM-SIGPLAN Conference on Programming Language Design and Implementation, 306–316, 1991.

    Google Scholar 

  22. A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, 8, 99–118, 1977.

    Article  MATH  Google Scholar 

  23. M. J. Maher, Logic Semantics for a Class of Committed-Choice Programs, Proc. 4th International Conference on Logic Programming, 858–876, 1987.

    Google Scholar 

  24. K. Marriott & P. J. Stuckey, Programming with Constraints: An Introduction, MIT Press, 1998.

    Google Scholar 

  25. L. Naish, Negation and Control in Prolog, LNCS 238, Springer, 1985.

    Google Scholar 

  26. V. Saraswat, CP as a General-purpose Constraint-language, Proc. AAAI-87, 53–58, 1987.

    Google Scholar 

  27. V. Saraswat, Concurrent Constraint Programming, MIT Press, 1993.

    Google Scholar 

  28. V. Saraswat & M. Rinard, Concurrent Constraint Programming, Proc. 17th ACM Symp. on Principles of Programming Languages, 232–245, 1990.

    Google Scholar 

  29. V. Saraswat, M. Rinard & P. Panangaden, Semantic Foundation of Concurrent Constraint Programming, Proc. 18th ACM Symp. on Principles of Programming Languages, 333–352, 1991.

    Google Scholar 

  30. G. Sidebottom & W. Havens, Hierarchical Arc Consistency Applied to Numeric Processing in Constraint Logic Programming, Comp. Intelligence 8(4), 1992.

    Google Scholar 

  31. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, 1989.

    Google Scholar 

  32. P. Van Roy, P. Brand, D. Duchier, S. Haridi, M. Henz, C. Schulte, Logic programming in the context of multiparadigm programming: the Oz experience, Theory and Practice of Logic Programming, to appear.

    Google Scholar 

  33. M. Wallace, Separating Logic and Control in Constraint Programming, 1994.

    Google Scholar 

  34. J. Würtz, Towards the Verification of Concurrent Constraint Programs in the Field of Finite Domain Reasoning, Proc. Workshop on Verification and Analysis of Logic Languages, 87–107, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, Griffith University, Brisbane, Australia

    Michael J. Maher

  2. Department of Mathematical and Computing Sciences, Loyola University, Chicago

    Michael J. Maher

Authors
  1. Michael J. Maher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, University of Melbourne, 221 Bouverie St., Carlton, 3053, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maher, M.J. (2002). Propagation Completeness of Reactive Constraints. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45619-8_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43930-1

  • Online ISBN: 978-3-540-45619-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation