Optimal union-find in Constraint Handling Rules

DOI10.1017/S1471068405002541MaRDI QIDQ3426204zbMATH OpenOpenAlexFDO

Authors 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

constraint handling rulesdeclarative algorithmsdisjoint-set problemtime complexity analysisunion-find algorithm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logic Programming
• Logic Programming
• Theory and practice of constraint handling rules
• Constraint solving with constraint handling rules
• Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR

Cited in

(9)

• As time goes by: constraint handling rules
• Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
• Adaptive CHR Meets CHR ∨
• Description and optimization of abstract machines in a dialect of Prolog
• Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
• Attributed Data for CHR Indexing
• Logic Programming
• Transactions in Constraint Handling Rules
• Automatic differentiation in Prolog

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426204)