Title: Optimal union-find in Constraint Handling Rules
Authors: Schrijvers, Tom ×
Fruehwirth, Thom #
Issue Date: Jan-2006
Publisher: Cambridge univ press
Series Title: Theory and practice of logic programming vol:6 pages:213-224
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 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.
ISSN: 1471-0684
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
ouf.pdf Submitted 153KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science