Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theory and Practice of Logic Programming
Optimizing compilation of CHR with rule priorities
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
| Hi-index | 0.00 |
This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHRrp: CHR with rule priorities and show that the meta-complexity theorem for LA can be applied to a subset of CHRrp via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the complexity required for the metacomplexity theorem to hold and can execute a subset of CHRrp with strong complexity bounds.