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

Memory Reuse for CHR

  • Conference paper
Logic Programming (ICLP 2006)

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

Included in the following conference series:

Abstract

Two Constraint Handling Rules compiler optimizations that drastically reduce the memory footprint of CHR programs are introduced. The reduction is the result of reusing suspension terms, the internal CHR constraint representation, and avoiding the overhead of constraint removal followed by insertion. The optimizations are defined formally and their correctness is proved. Both optimizations were implemented in the K.U.Leuven CHR system. Significant memory savings and speedups were measured on classical and well-known benchmarks.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. The K.U.Leuven CHR system, http://www.cs.kuleuven.be/~toms/Research/CHR/

  2. Demoen, B.: The hProlog home page, http://www.cs.kuleuven.be/~bmd/hProlog/

  3. Duck, G.J., Stuckey, P.J., García de la Banda, M., 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Holzbaur, C., Frühwirth, T.: Compiling constraint handling rules into Prolog with attributed variables. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 117–133. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Mazur, N.: Compile-time Garbage Collection for the Declarative Language Mercury. PhD thesis, K.U.Leuven, Leuven, Belgium (May 2004)

    Google Scholar 

  7. Mazur, N., Ross, P., Janssens, G., Bruynooghe, M.: Practical Aspects for a Working Compile Time Garbage Collection System for Mercury. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, p. 105. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Schrijvers, T.: Analyses, Optimizations and Extensions of Constraint Handling Rules. PhD thesis, K.U.Leuven, Leuven, Belgium (June 2005)

    Google Scholar 

  9. Schrijvers, T., Stuckey, P., Duck, G.: Abstract Interpretation for Constraint Handling Rules. In: Proceedings of the 7th Intl. Conference on Principles and Practice of Declarative Programming (PPDP 2005), Lisbon, Portugal (July 2005)

    Google Scholar 

  10. Sneyers, J., Schrijvers, T., Demoen, B.: The computational power and complexity of Constraint Handling Rules. In: Proc. 2nd Workshop on Constraint Handling Rules (CHR 2005), Sitges, Spain, pp. 3–17 (October 2005)

    Google Scholar 

  11. Sneyers, J., Schrijvers, T., Demoen, B.: Suspension optimization and in-place updates for optimizing CHR compilation. Technical Report CW 433, K.U.Leuven, Dept. CS (December 2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sneyers, J., Schrijvers, T., Demoen, B. (2006). Memory Reuse for CHR. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_8

Download citation

  • DOI: https://doi.org/10.1007/11799573_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36635-5

  • Online ISBN: 978-3-540-36636-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics