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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Sneyers, J., Schrijvers, T., & Demoen, B. (2006). Memory reuse for CHR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4079 LNCS, pp. 72–86). Springer Verlag. https://doi.org/10.1007/11799573_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
