Abstract
CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). In particualr, we show how we can use different kinds of information in the compilation of CHRs in order to obtain access efficiency, and a better translation of the CHR rules into the underlying language. The kinds of information used include the types, modes, determinism, functional dependencies and symmetries of the CHR constraints. We also show how to analyze CHR programs to determine information about functional dependencies, symmetries and other kinds of information supporting optimizations.
Original language | English |
---|---|
Title of host publication | Logic Programming |
Subtitle of host publication | 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings |
Editors | Philippe Codognet |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 74-89 |
Number of pages | 16 |
ISBN (Print) | 3540429352 |
DOIs | |
Publication status | Published - 2001 |
Event | International Conference on Logic Programming 2001 - Paphos, Cyprus Duration: 26 Nov 2001 → 1 Dec 2001 Conference number: 17th https://link.springer.com/book/10.1007/3-540-45635-X (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 2237 |
ISSN (Print) | 0302-9743 |
Conference
Conference | International Conference on Logic Programming 2001 |
---|---|
Abbreviated title | ICLP 2001 |
Country/Territory | Cyprus |
City | Paphos |
Period | 26/11/01 → 1/12/01 |
Internet address |
|