Optimal Union-Find in Constraint Handling Rules
Tom Schrijvers, Thom Fruehwirth
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.
Create a lesson
Related papers
Handling JAX
Oghenevwogaga Ebresafe, Daniel Zheng, Gordon Plotkin et al.
Silent Degradation during Auto-Vectorization of bf16/fp16 on RISC-V Under LLVM
Vaishnavi Kouru, Robert Chun
Functional Logic Programming: Improving Logic Programs with Ease
Michael Hanus
Vectorizing Recurrences over Semirings
Yihong Zhang, Bala Vinaithirthan, Karima Ma et al.
MBUndo: Sound, Automatic, and Efficient Measurement-Based Uncomputation for Quantum Circuits
Shengyuan Yang, Charles Yuan
te-comp: A Complete MLIR Compiler Generating Self-Contained C Inference Engines for MCUs
Van Chan Ngo