Abstract
Constraint Handling Rules were recently extended with user-definable rule priorities. This paper shows how this extended language can be efficiently compiled into the underlying host language. It extends previous work by supporting rules with dynamic priorities and by introducing various optimizations. The effects of the optimizations are empirically evaluated and the new compiler is compared with the state-of-the-art K.U.Leuven CHR system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
De Koninck, L., Schrijvers, T., Demoen, B.: The correspondence between the Logical Algorithms language and CHR. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 209–223. Springer, Heidelberg (2007)
De Koninck, L., Schrijvers, T., Demoen, B.: User-definable rule priorities for CHR. In: 9th ACM SIGPLAN Symp. on Principles and Practice of Declarative Programming, pp. 25–36 (2007)
De Koninck, L., Sneyers, J.: Join ordering for Constraint Handling Rules. In: 4th Workshop on Constraint Handling Rules, pp. 107–121 (2007)
De Koninck, L., Stuckey, P.J., Duck, G.J.: Optimized compilation of CHRrp. Technical Report CW 499, K.U.Leuven, Belgium (2007)
Duck, G.J., Stuckey, P.J., GarcÃa de la Banda, M., Holzbaur, C.: The refined operational semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)
Forgy, C.L.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artif. Intell. 19(1), 17–37 (1982)
Frühwirth, T.: Theory and practice of Constraint Handling Rules. J. Log. Program. 37(1-3), 95–138 (1998)
Ganzinger, H., McAllester, D.A.: Logical algorithms. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 209–223. Springer, Heidelberg (2002)
Holzbaur, C., GarcÃa de la Banda, M., Stuckey, P.J., Duck, G.J.: Optimizing compilation of Constraint Handling Rules in HAL. Theory and Practice of Logic Programming: Special Issue on Constraint Handling Rules 5(4 & 5), 503–531 (2005)
Miranker, D.P.: TREAT: A better match algorithm for AI production system matching. In: 6th National Conf. on Artificial Intelligence, pp. 42–47. AAAI Press, Menlo Park (1987)
Morawietz, F.: Chart parsing and constraint programming. In: 18th Intl. Conf. Computational Linguistics, pp. 551–557. Morgan Kaufmann, San Francisco (2000)
Schrijvers, T.: Analyses, Optimizations and Extensions of Constraint Handling Rules. PhD thesis, K.U.Leuven, Leuven, Belgium (2005)
Schrijvers, T., Demoen, B.: The K.U.Leuven CHR system: Implementation and application. In: 1st Workshop on CHR, Selected Contributions, Ulmer Informatik-Berichte 2004-01, pp. 1–5. Universität Ulm, Germany (2004)
Schrijvers, T., et al.: The Constraint Handling Rules home page (2007), http://www.cs.kuleuven.be/~dtai/projects/CHR/
Schrijvers, T., Frühwirth, T.: Optimal union-find in Constraint Handling Rules. Theory and Practice of Logic Programming 6(1&2) (2006)
Sneyers, J., Schrijvers, T., Demoen, B.: Dijkstra’s algorithm with Fibonacci heaps: An executable description in CHR. In: 20th Workshop on Logic Programming, INFSYS Research Report 1843-06-02, pp. 182–191. TU Wien (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Koninck, L., Stuckey, P.J., Duck, G.J. (2008). Optimizing Compilation of CHR with Rule Priorities. In: Garrigue, J., Hermenegildo, M.V. (eds) Functional and Logic Programming. FLOPS 2008. Lecture Notes in Computer Science, vol 4989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78969-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-78969-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78968-0
Online ISBN: 978-3-540-78969-7
eBook Packages: Computer ScienceComputer Science (R0)