Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Welcome to Constraint Handling Rules

  • Chapter
Constraint Handling Rules

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5388))

Abstract

Constraint Handling Rules (CHR) is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. As an introduction to CHR as a general-purpose programming language we present some small programs using different programming styles and discuss their properties.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abdennadher, S.: Operational Semantics and Confluence of Constraint Propagation Rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330. Springer, Heidelberg (1997)

    Google Scholar 

  2. Abdennadher, S., Frühwirth, T., Holzbaur, C. (eds.): Special Issue on Constraint Handling Rules. Journal of Theory and Practice of Logic Programming (TPLP) (to appear, 2005)

    Google Scholar 

  3. Abdennadher, S., Frühwirth, T., Meuss, H.: Confluence and Semantics of Constraint Simplification Rules. Constraints 4(2), 133–165 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Banâtre, J.-P., Coutant, A., Le Metayer, D.: A Parallel Machine for Multiset Transformation and its Programming Style. Future Generation Computer Systems 4(2), 133–144 (1988)

    Article  Google Scholar 

  5. Brownston, L., Farrell, R., Kant, E., Martin, N.: Programming Expert Systems in OPS5: An Introduction to Rule-based Programming. Addison-Wesley, Boston (1985)

    Google Scholar 

  6. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge Univ. Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  7. Duck, G.J., Stuckey, P.J., de la Banda, M.G., Holzbaur, C.: The Refined Operational Semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) Proceedings of the 20th International Conference on Logic Programming (2004)

    Google Scholar 

  8. Frühwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)

    Book  MATH  Google Scholar 

  9. Frühwirth, T.: Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic programming. Journal of Logic Programming 37(1-3), 95–138 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Frühwirth, T.: Proving Termination of Constraint Solver Programs. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS, vol. 1865, pp. 298–317. Springer, Heidelberg (2000)

    Google Scholar 

  11. Frühwirth, T.: Constraint Handling Rules. Cambridge University Press, Cambridge (to appear, 2008)

    MATH  Google Scholar 

  12. Schrijvers, T., Frühwirth, T.: CHR Website (May 2005), http://www.cs.kuleuven.ac.be/~dtai/projects/CHR/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Frühwirth, T. (2008). Welcome to Constraint Handling Rules. In: Schrijvers, T., Frühwirth, T. (eds) Constraint Handling Rules. Lecture Notes in Computer Science(), vol 5388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92243-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92243-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-92243-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics