Optimal union-find in Constraint Handling Rules

DOI10.1017/S1471068405002541zbMath1109.68029OpenAlexW2019417713MaRDI QIDQ3426204

Tom Schrijvers, Thom Frühwirth

Publication date: 8 March 2007

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068405002541

zbMATH Keywords

time complexity analysisconstraint handling rulesunion-find algorithmdeclarative algorithmsdisjoint-set problem

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (6)

Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR ⋮ Attributed Data for CHR Indexing ⋮ Description and Optimization of Abstract Machines in a Dialect of Prolog ⋮ Adaptive CHR Meets CHR ∨ ⋮ As time goes by: Constraint Handling Rules ⋮ Transactions in Constraint Handling Rules

This page was built for publication: Optimal union-find in Constraint Handling Rules