Computer Science – Programming Languages
Scientific paper
2004-08-10
Theory and Practice of Logic Programming: 5(4-5):503-532, 2005
Computer Science
Programming Languages
29 pages 6 figures, 4 tables. To appear in Theory and Practice of Logic Programming (TPLP)
Scientific paper
In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). 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 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, which in this case is HAL. 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 this information about functional dependencies, symmetries and other kinds of information supporting optimizations.
Duck Gregory J.
Holzbaur Christian
la Banda Maria Garcia de
Stuckey Peter J.
No associations
LandOfFree
Optimizing compilation of constraint handling rules in HAL does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimizing compilation of constraint handling rules in HAL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing compilation of constraint handling rules in HAL will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-689396