Analysing the CHR implementation of union-find

19th Workshop on (Constraint) Logic Programming, W(C)LP 2005

Volumn , Issue , 2005, Pages 135-146

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

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LOGIC PROGRAMMING; PROLOG (PROGRAMMING LANGUAGE);

ANALYSIS TECHNIQUES; CONSTRAINT HANDLING RULES; GENERAL-PURPOSE PROGRAMMING LANGUAGE; LOGICAL CORRECTNESS; RULE-BASED LANGUAGE; TIME COMPLEXITY; UNION-FIND; WRITING CONSTRAINT;

COMPUTER PROGRAMMING LANGUAGES;

EID: 27144558534     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. Abdennadher. Operational semantics and conuence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, CP97, LNCS 1330. Springer, 1997.
2. S. Abdennadher, T. Frühwirth, and H. Meuss. Conuence and semantics of constraint simplification rules. Constraints Journal, 4(2), 1999.
3. H. Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, 1991.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
5. G. J. Duck, P. J. Stuckey, M. G. de la Banda, and C. Holzbaur. The refined operational semantics of constraint handling rules. In B. Demoen and V. Lifschitz, editors, Proceedings of the 20th International Conference on Logic Programming, 2004.
6. T. Frühwirth. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, pages 95-138, October 1998.
7. T. Frühwirth. As time goes by: Automatic complexity analysis of simplification rules. In 8th International Conference on Principles of Knowledge Representation and Reasoning, Toulouse, France, 2002.
8. T. Frühwirth and S. Abdennadher. Essentials of Constraint Programming. Springer, 2003.
9. Z. Galil and G. F. Italiano. Data structures and algorithms for disjoint set union problems. ACM Comp. Surveys, 23(3): 319, 1991.
10. H. Ganzinger and D. McAllester. A new meta-complexity theorem for bottom-up logic programs. In International Joint Conference on Automated Reasoning, LNCS 2083, pages 514-528. Springer, 2001.
11. D. Sahlin and M. Carlsson. Variable Shunting for the WAM. Technical Report SICS/R-91/9107, SICS, 1991.
12. T. Schrijvers and T. Fruehwirth. Optimal union-find in constraint handling rules. Technical report, November 2004.
13. T. Schrijvers and T. Fruehwirth. Union-find in chr. Technical Report CW389, Department of Computer Science, K. U. Leuven, Belgium, July 2004.
14. R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. J. ACM, 31(2): 245-281, 1984.
15. A. Wolf. Adaptive constraint handling with chr in java. In 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), LNCS 2239. Springer, 2001.