Optimal Union-Find in Constraint Handling Rules

Details Optimal Union-Find in Constraint Handling Rules Optimal Union-Find in Constraint Handling Rules

2005-01-25

arxiv.org/abs/cs/0501073v1

Computer Science

Programming Languages

12 pages, 3 figures, to appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Union-Find in Constraint Handling Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Union-Find in Constraint Handling Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Union-Find in Constraint Handling Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513155