Article

Optimizing Compilation of Constraint Handling Rules

Authors:

Christian Holzbaur,

Maria J. García de la Banda,

David Jeffery,

Peter J. StuckeyAuthors Info & Claims

Proceedings of the 17th International Conference on Logic Programming

Pages 74 - 89

Published: 26 November 2001 Publication History

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.

References

[1]

S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming , pages 252-266, 1997.

Google Scholar

[2]

B. Demoen, M. García de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming , pages 174-188, 1999.

Crossref

Google Scholar

[3]

T. Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming , 37(1-3):95-138, 1998.

Google Scholar

[4]

C. Holzbaur and T. Frühwirth. Constraint handling rules, special issue. Journal of Applied Artificial Intelligence , 14(4), 2000.

Google Scholar

[5]

JACK: Java constraint kit. http://www.fast.de/~mandel/jack/.

Google Scholar

[6]

Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming , 29:17-64, 1996.

Google Scholar

Cited By

View all

Tacchella PGabbrielli MMeo MLeuschel MPodelski A(2007)Unfolding in CHRProceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1273920.1273945(179-186)Online publication date: 14-Jul-2007
https://dl.acm.org/doi/10.1145/1273920.1273945
Sarna-Starosta BRamakrishnan C(2007)Compiling constraint handling rules for efficient tabled evaluationProceedings of the 9th international conference on Practical Aspects of Declarative Languages10.1007/978-3-540-69611-7_11(170-184)Online publication date: 14-Jan-2007
https://dl.acm.org/doi/10.1007/978-3-540-69611-7_11
Apt KBrand SLamont GHaddad HPapadopoulos GPanda B(2003)Schedulers for rule-based constraint programmingProceedings of the 2003 ACM symposium on Applied computing10.1145/952532.952537(14-21)Online publication date: 9-Mar-2003
https://dl.acm.org/doi/10.1145/952532.952537
Show More Cited By

Recommendations

Optimizing compilation of constraint handling rules in HAL

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 ...
Constraint Handling Rules
ICLP '08: Proceedings of the 24th International Conference on Logic Programming

Constraint Handling Rules (CHR) [2,5] is a high-level programming language based on multi-headed, committed-choice, guarded multiset rewrite rules. Originally designed in 1991 by Frühwirth for the particular purpose of adding user-defined constraint ...
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
ICLP '09: Proceedings of the 25th International Conference on Logic Programming

Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been ...

Comments

Information & Contributors

Information

Published In

Proceedings of the 17th International Conference on Logic Programming

November 2001

364 pages

ISBN:3540429352

Editor:
Philippe Codognet

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 November 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tacchella PGabbrielli MMeo MLeuschel MPodelski A(2007)Unfolding in CHRProceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1273920.1273945(179-186)Online publication date: 14-Jul-2007
https://dl.acm.org/doi/10.1145/1273920.1273945
Sarna-Starosta BRamakrishnan C(2007)Compiling constraint handling rules for efficient tabled evaluationProceedings of the 9th international conference on Practical Aspects of Declarative Languages10.1007/978-3-540-69611-7_11(170-184)Online publication date: 14-Jan-2007
https://dl.acm.org/doi/10.1007/978-3-540-69611-7_11
Apt KBrand SLamont GHaddad HPapadopoulos GPanda B(2003)Schedulers for rule-based constraint programmingProceedings of the 2003 ACM symposium on Applied computing10.1145/952532.952537(14-21)Online publication date: 9-Mar-2003
https://dl.acm.org/doi/10.1145/952532.952537
Duck GStuckey PGarcia de la Banda MHolzbaur CSagonas KMiller D(2003)Extending arbitrary solvers with constraint handling rulesProceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming10.1145/888251.888260(79-90)Online publication date: 27-Aug-2003
https://dl.acm.org/doi/10.1145/888251.888260

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations