Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Introduction to algorithms
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Warren's Abstract Machine: A Tutorial Reconstruction
Warren's Abstract Machine: A Tutorial Reconstruction
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Variable Shunting for the WAM
Intelligent search strategies based on adaptive Constraint Handling Rules
Theory and Practice of Logic Programming
Optimizing compilation of constraint handling rules in HAL
Theory and Practice of Logic Programming
User-definable rule priorities for CHR
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Tchr: A framework for tabled clp
Theory and Practice of Logic Programming
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Recent Advances in Constraints
Transactions in Constraint Handling Rules
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Theory and Practice of Logic Programming
From exponential to almost linear decomposability of finite or infinite trees
Proceedings of the 2009 ACM symposium on Applied Computing
Constraint Handling Rules
Attributed Data for CHR Indexing
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Automatic Implication Checking for CHR Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
A unified semantics for constraint handling rules in transaction logic
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Complexity of a CHR solver for existentially quantified conjunctions of equations over trees
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
The correspondence between the logical algorithms language and CHR
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Observable confluence for constraint handling rules
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Optimizing compilation of CHR with rule priorities
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Towards consistency oblivious programming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Constraint Handling Rules (CHR) is a committed-choice rule-based language that was originally intended for writing constraint solvers. In this paper we show that it is also possible to write the classic union-find algorithm and variants in CHR. The programs neither compromise in declarativeness nor efficiency. We study the time complexity of our programs: they match the almost-linear complexity of the best known imperative implementations. This fact is illustrated with experimental results.