CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Building Constraint Solvers with HAL
Proceedings of the 17th International Conference on Logic Programming
To the Gates of HAL: A HAL Tutorial
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Extending arbitrary solvers with constraint handling rules
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Schedulers for rule-based constraint programming
Proceedings of the 2003 ACM symposium on Applied computing
Schedulers and redundancy for a class of constraint propagation rules
Theory and Practice of Logic Programming
Optimizing compilation of constraint handling rules in HAL
Theory and Practice of Logic Programming
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Guard Reasoning in the Refined Operational Semantics of CHR
Constraint Handling Rules
Compiling constraint handling rules for efficient tabled evaluation
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
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.