Optimal Union-Find in Constraint Handling Rules (2006)
Cached
Download Links
- [www.cs.kuleuven.ac.be]
- [www.cs.kuleuven.be]
- DBLP
Other Repositories/Bibliography
| Venue: | THEORY AND PRACTICE OF LOGIC PROGRAMMING |
| Citations: | 32 - 25 self |
BibTeX
@ARTICLE{Schrijvers06optimalunion-find,
author = {Tom Schrijvers and Thom Frühwirth},
title = {Optimal Union-Find in Constraint Handling Rules},
journal = {THEORY AND PRACTICE OF LOGIC PROGRAMMING},
year = {2006},
volume = {6},
number = {1},
pages = {213--224}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 e#ciency. 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.
