Optimal Union-Find in Constraint Handling Rules

Simple item page
dc.creatorSchrijvers, Tom
dc.creatorFruehwirth, Thom
dc.date2005-01-25
dc.date.accessioned2026-07-07T03:22:24Z
dc.date.available2026-07-07T03:22:24Z
dc.descriptionConstraint 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.
dc.description12 pages, 3 figures, to appear in Theory and Practice of Logic Programming (TPLP)
dc.identifierhttps://arxiv.org/abs/cs/0501073
dc.identifierhttp://arxiv.org/abs/cs/0501073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32580
dc.subjectProgramming Languages
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.subjectPerformance
dc.titleOptimal Union-Find in Constraint Handling Rules
dc.typetext

Files

Collections

arXiv