Research Summary: Termination of CHR | SpringerLink
Skip to main content
Springer Nature Link
Log in

Research Summary: Termination of CHR

  • Conference paper
Logic Programming (ICLP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5649))

Included in the following conference series:

  • 768 Accesses

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

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

    Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, K.U. Leuven, Belgium

    Paolo Pilozzi

Authors
  1. Paolo Pilozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, University of Leeds, LS2 9JT, Leeds, UK

    Patricia M. Hill

  2. Deptartment of Computer Science, Stony Brook University, 11794-4400, Stony Brook, NY, USA

    David S. Warren

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation