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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
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)
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)
Frühwirth, T.: Theory and practice of Constraint Handling Rules. Journal of Logic Programming 37(1-3), 95–138 (1998)
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)
Gabbrielli, M., Meo, M.C.: A Compositional Semantics for CHR. In: ACM Transactions on Computational Logic (to appear, 2008)
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)
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)
Holzbaur, C., Frühwirth, T.: A Prolog constraint handling rules compiler and runtime system. Journal of Applied Artificial Intelligence 14(4) (2000)
Jaffar, J., Maher, M.: Constraint logic programming: a survey. Journal of Logic Programming 19/20, 503–582 (1994)
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)
Schrijvers, T.: Analyses, Optimizations and Extensions of Constraint Handling Rules. Ph.D thesis, Katholieke Universiteit Leuven (June 2005)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)