Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Expert Systems: Principles and Programming
Expert Systems: Principles and Programming
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Compiling Constraint Handling Rules into Prolog with Attributed Variables
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Jess in Action: Java Rule-Based Systems
Jess in Action: Java Rule-Based Systems
Optimizing compilation of constraint handling rules in HAL
Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
A history of Haskell: being lazy with class
Proceedings of the third ACM SIGPLAN conference on History of programming languages
Constraint Handling Rules
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The correspondence between the logical algorithms language and CHR
ICLP'07 Proceedings of the 23rd international conference on Logic programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Transactions in Constraint Handling Rules
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Turing-Complete Subclasses of CHR
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Theory and Practice of Logic Programming
A Compositional Semantics for CHR with Propagation Rules
Constraint Handling Rules
On the expressive power of priorities in CHR
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Attributed Data for CHR Indexing
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
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
Decidability properties for fragments of chr
Theory and Practice of Logic Programming
Compiling CHR to parallel hardware
Proceedings of the 14th symposium on Principles and practice of declarative programming
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction
ACM Transactions on Computational Logic (TOCL)
Diagrammatic confluence for constraint handling rules*
Theory and Practice of Logic Programming
The expressive power of CHR with priorities
Information and Computation
| Hi-index | 0.00 |
Constraint Handling Rules (CHR) is a high-level rule-based programming language which is increasingly used for general-purpose programming. We introduce the CHR machine, a model of computation based on the operational semantics of CHR. Its computational power and time complexity properties are compared to those of the well-understood Turing machine and Random Access Memory machine. This allows us to prove the interesting result that every algorithm can be implemented in CHR with the best known time and space complexity. We also investigate the practical relevance of this result and the constant factors involved. Finally we expand the scope of the discussion to other (declarative) programming languages.