Abstract
Constraint Handling Rules (CHR) [7] is a high-level programming language, designed for the easy implementation of custom constraint solvers. CHR is a language-extension, built on top of Java, C and half a dozen Prolog-variants. The language is currently used in many projects [7].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Frühwirth, T.: Proving Termination of Constraint Solver Programs. In: New Trends in Contraints, Joint ERCIM/Compulog Net Workshop, Selected papers, pp. 298–317 (2000)
Thang Nguyen, M., De Schreye, D.: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 311–325. Springer, Heidelberg (2005)
Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination Analysis of Logic Programs Based on Dependency Graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 8–22. Springer, Heidelberg (2008)
Pilozzi, P., De Schreye, D.: Termination analysis of CHR revisited. In: ICLP 2008: Proceedings of the 24th International Conference on Logic Programming, pp. 501–515 (2008)
Pilozzi, P., De Schreye, D.: Automating Termination Proofs for CHR. In: ICLP 2009: Proceedings of the 25th International Conference on Logic Programming (accepted for publication, 2009)
Pilozzi, P., De Schreye, D.: Termination Analysis by Invariance Relations. In: ICLP 2009: Proceedings of the 25th International Conference on Logic Programming (accepted for publication, 2009)
Sneyers, J., Van Weert, P., Schrijvers, T., De Koninck, L.: As Time Goes By: Constraint Handling Rules – A Survey of CHR Research between 1998 and 2007. Submitted to Theory and Practice of Logic Programming (2009)
Voets, D., Pilozzi, P., De Schreye, D.: A new approach to termination analysis of CHR. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 28–42. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pilozzi, P. (2009). Research Summary: Termination of CHR. In: Hill, P.M., Warren, D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02846-5_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-02846-5_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02845-8
Online ISBN: 978-3-642-02846-5
eBook Packages: Computer ScienceComputer Science (R0)