Skip to main content
SpringerLink
Log in

A Compositional Semantics for CHR with Propagation Rules

  • Chapter
Constraint Handling Rules

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

  • 398 Accesses

Abstract

Constraint Handling Rules (CHR) is a committed-choice declarative language which has originally been designed for writing constraint solvers and which is nowadays a general purpose language.

In [7,11] a trace based, compositional semantics for CHR has been defined. Such a compositional model uses as reference operational semantics the original “naive” one [9] which, due to the propagation rule, admits trivial non-termination. In this paper we extend the work of [7,11] by considering a more refined operational semantics which avoids trivial non-termination.

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. Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 252–266. Springer, Heidelberg (1997)

    Google Scholar 

  2. Abdennadher, S., Krämer, E., Saft, M., Schmauss, M.: JACK: a Java constraint kit. Electronic Notes in Theoretical Computer Science, vol. 64. Elsevier, Amsterdam (2000)

    Google Scholar 

  3. de Boer, F.S., Gabbrielli, M., Meo, M.C.: Semantics and expressive power of a timed concurrent constraint language. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 47–61. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. de Boer, F.S., Palamidessi, C.: A Fully Abstract Model for Concurrent Constraint Programming. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 296–319. Springer, Heidelberg (1991)

    Google Scholar 

  5. Brookes, S.: A fully abstract semantics of a shared variable parallel language. In: Proc. of the Eighth IEEE Symposium on Logic In Computer Science, pp. 98–109. IEEE Computer Society Press, Los Alamitos (1993)

    Chapter  Google Scholar 

  6. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  7. Delzanno, G., Gabbrielli, M., Meo, M.C.: A Compositional Semantics for CHR. In: PPDP 2005: Proc. of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 209–217. ACM, New York (2005)

    Google Scholar 

  8. 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.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Frühwirth, T.: Constraint Handling Rules: The Story So Far. In: PPDP 2006: Proc. of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming, pp. 13–14. ACM, New York (2006)

    Google Scholar 

  11. Gabbrielli, M., Meo, M.C.: A Compositional Semantics for CHR. In: ACM Transactions on Computational Logic (to appear, 2008)

    Google Scholar 

  12. Garcia de la Banda, M., Demoen, B., Mariott, K., Stuckey, P.J.: To the gates of HAL: a HAL tutorial. In: Hu, Z., Rodríguez-Artalejo, M. (eds.) FLOPS 2002. LNCS, vol. 2441, pp. 47–66. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Hanus, M.: Adding Constraint Handling Rules to Curry. In: Proc. of the 20th Workshop on Logic Programming (WLP 2006), pp. 81–90. INFSYS Research Report 1843-06-02, TU Wien (2006)

    Google Scholar 

  14. Holzbaur, C., Frühwirth, T.: A Prolog constraint handling rules compiler and runtime system. Journal of Applied Artificial Intelligence 14(4) (2000)

    Google Scholar 

  15. Jaffar, J., Maher, M.: Constraint logic programming: a survey. Journal of Logic Programming 19/20, 503–582 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Jonsson, B.: A model and a proof system for asynchronous processes. In: Proc. of the 4th ACM Symp. on Principles of Distributed Computing, pp. 49–58. ACM Press, New York (1985)

    Google Scholar 

  17. Schrijvers, T.: Analyses, Optimizations and Extensions of Constraint Handling Rules. Ph.D thesis, Katholieke Universiteit Leuven (June 2005)

    Google Scholar 

  18. Sulzmann, M., Lam, E.S.L.: Compiling Constraint Handling Rules with Lazy and Concurrent Search Techniques. In: Proc. of Fourth Workshop on Constraint Handling Rules, pp. 139–149 (2007)

    Google Scholar 

  19. Sneyers, J., Schrijvers, T., Demoen, B.: The Computational Power and Complexity of Constraint Handling Rules. ACM Transactions on Programming Languages and Systems (to appear, 2008)

    Google Scholar 

  20. Wuille, P., Schrijvers, T., Demoen, B.: CCHR: the fastest CHR Implementation, in C. In: Proc. of Fourth Workshop on Constraint Handling Rules, pp. 123–137 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Mura A.Zamboni 7, 40127, Bologna, Italy

    Maurizio Gabbrielli & Paolo Tacchella

  2. Dipartimento di Scienze, Università di Chieti-Pescara, Viale Pindaro 42, 65127, Pescara, Italy

    Maria Chiara Meo

Authors
  1. Maurizio Gabbrielli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Chiara Meo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Tacchella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3001, Heverlee, Belgium

    Tom Schrijvers

  2. Fakultät für Ingenieurwissenschaften und Informatik, Universität Ulm, 89069, Ulm, Germany

    Thom Frühwirth

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gabbrielli, M., Meo, M.C., Tacchella, P. (2008). A Compositional Semantics for CHR with Propagation 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_6

Download citation

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

  • 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

Search

Navigation