Optimal union-find in Constraint Handling Rules

Theory and Practice of Logic Programming

Volumn 6, Issue 1-2, 2006, Pages 213-224

  Schrijvers, Tom ^a   Frühwirth, Thom ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

Constraint handling rules; Declarative algorithms; Disjoint set problem; Time complexity analysis; Union find algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SEMANTICS;

CONSTRAINED HANDLING RULES; DECLARATIVE ALGORITHMS; DISJOINT-SET PROBLEMS; TIME COMPLEXITY ANALYSIS; UNION-FIND ALGORITHMS;

CONSTRAINT THEORY;

EID: 31644450280     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068405002541     Document Type: Article

References (17)

1. AÏT-KACI, H. 1991. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press.
2. CORMEN, T. H., LEISERSON, C. E. AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press.
3. DUCK, G. J., STUCKEY, P. J., DE LA BANDA, M. G. AND HOLZBAUR, C. 2004. The Refined Operational Semantics of Constraint Handling Rules. Proceedings of the 20th International Conference on Logic Programming, B. Demoen and V. Lifschitz, Eds., 90-104.
4. FRÜHWIRTH, T. 1998. Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming. Journal of Logic Programming 37, 1-3, 95-138.
5. FRÜHWIRTH, T. 2002. As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs. Electronic Notes in Theoretical Computer Science, A. D. Pierro and H. Wiklicky, Eds. Vol. 59. Elsevier, 1-22.
6. FRÜHWIRTH, T. AND ABDENNADHER, S. 2003. Essentials of Constraint Programming. Springer.
7. GALIL, Z. AND ITALIANO, G. F. 1991. Data structures and algorithms for disjoint set union problems. ACM Comput. Surv. 23(3), 319-344.
8. GANZINGER, H. AND MCALLESTER, D. 2001. A New Meta-Complexity Theorem for Bottom-Up Logic Programs. In International Joint Conference on Automated Reasoning. LNCS 2083, 514-528. Springer.
9. HOLZBAUR, C., GARCÍA DE LA BANDA, M., STUCKEY, P. J. AND DUCK, G. J. 2005. Optimizing Compilation of Constraint Handling Rules in HAL. Theory and Practice of Logic Programming: Special Issue on Constraint Handling Rules 5, Issue 4 & 5, 503-531.
10. INTELLIGENT SYSTEMS LABORATORY. 2003. SICStus Prolog User's Manual. PO Box 1263, SE-164 29 Kista, Sweden.
11. SAHLIN, D. AND CARLSSON, M. 1991. Variable Shunting for the WAM. Tech. Rep. SICS/R-91/9107, SICS.
12. SCHRIJVERS, T. AND DEMOEN, B. 2004. The K.U.Leuven CHR system: Implementation and Application. First Workshop on Constraint Handling Rules: Selected Contributions, T. Frühwirth and M. Meister, Eds. Number 2004-01. 8-12.
13. SCHRIJVERS, T. AND FRÜHWIRTH, T. 2004. Union-Find in CHR. Tech. Rep. CW389, Department of Computer Science, K.U.Leuven, Belgium.
14. SCHRIJVERS, T. AND FRÜHWIRTH, T. 2005. Analysing the CHR implementation of union-find. Proceedings of 19th Workshop on (Constraint) Logic Programming, Ulm, Germany.
15. TARJAN, R. E. AND VAN LEEUWEN, J. 1984. Worst-case Analysis of Set Union Algorithms. J. ACM 31(2), 245-281.
16. WIELEMAKER, J. SWI-Prolog. http://www.swi-prolog.org/.
17. WOLF, A. 2005. Intelligent Search Strategies Based on Apdative Constraint Handling Rules. Theory and Practice of Logic Programming: Special Issue on Constraint Handling Rules 5, Issue 4 & 5, 567-594.