Abstract
This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHR\(^{\textrm{rp}}\): CHR with rule priorities and show that the meta-complexity theorem for LA can be applied to a subset of CHR\(^{\textrm{rp}}\) via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the complexity required for the meta-complexity theorem to hold and can execute a subset of CHR\(^{\textrm{rp}}\) with strong complexity bounds.
A longer version of this paper is available as Technical Report [11].
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
Christiansen, H.: A constraint-based bottom-up counterpart to definite clause grammars. In: Recent Advances in Natural Language Processing III, Selected Papers. Current Issues in Linguistic Theory vol. 260 (2004)
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, 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)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)
Frühwirth, T.: Theory and practice of constraint handling rules. J. Log. Program. 37(1-3), 95–138 (1998)
Frühwirth, T.: As time goes by II: More automatic complexity analysis of concurrent rule programs. Electr. Notes Theor. Comput. Sci., 59(3) (2001)
Frühwirth, T.: As time goes by: Automatic complexity analysis of concurrent rule programs. In: 8th Intl. Conf. Principles of Knowledge Representation and Reasoning, pp. 547–557 (2002)
Ganzinger, H., McAllester, D.A.: A new meta-complexity theorem for bottom-up logic programs. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 514–528. Springer, Heidelberg (2001)
Ganzinger, H., McAllester, D.A.: Logical algorithms. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 209–223. Springer, Heidelberg (2002)
De Koninck, L., Schrijvers, T., Demoen, B.: CHR\(^\textrm{rp}\): Constraint handling rules with rule priorities. Technical Report CW 479, K.U.Leuven, Belgium (March 2007)
De Koninck, L., Schrijvers, T., Demoen, B.: The correspondence between the logical algorithms language and CHR. Technical Report CW 480, K.U.Leuven, Belgium (March 2007)
McAllester, D.A.: On the complexity analysis of static analyses. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 312–329. Springer, Heidelberg (1999)
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: First Workshop on CHR: Selected Contributions. Ulmer Informatik-Berichte. Universität Ulm, vol. 2004-01, pp. 1–5 (2004)
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.: The computational power and complexity of Constraint Handling Rules. In: 2nd Workshop on Constraint Handling Rules. Reports CW, Dept. of Computer Science, K.U.Leuven, Belgium, vol. 421, pp. 3–17 (2005)
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, TU Wien, vol. 1843-06-02, pp. 182–191 (2006)
Van Weert, P., Sneyers, J., Schrijvers, T., Demoen, B.: Extending CHR with negation as absence. In: 3rd Workshop on CHR. Reports CW, Dept. of Computer Science, K.U. Leuven, Belgium, vol. 452, pp. 125–140 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Koninck, L., Schrijvers, T., Demoen, B. (2007). The Correspondence Between the Logical Algorithms Language and CHR. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-74610-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74608-9
Online ISBN: 978-3-540-74610-2
eBook Packages: Computer ScienceComputer Science (R0)