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
Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
User-definable rule priorities for CHR
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
The correspondence between the logical algorithms language and CHR
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Observable confluence for constraint handling rules
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Optimizing compilation of CHR with rule priorities
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
A complete and terminating execution model for constraint handling rules
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
This paper investigates the relationship between the Logical Algorithms (LA) language of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation schema 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. Inspired by the high-level implementation proposal for Logical Algorithm by Ganzinger and McAllester and based on a new scheduling algorithm, we propose an alternative implementation for CHRrp that gives strong complexity guarantees and results in a new and accurate meta-complexity theorem for CHRrp. It is furthermore shown that the translation from Logical Algorithms to CHRrp combined with the new CHRrp implementation satisfies the required complexity for the Logical Algorithms meta-complexity result to hold.