Formal Properties of Place/Transition Nets
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Computation: finite and infinite machines
Computation: finite and infinite machines
User-definable rule priorities for CHR
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)
Constraint Handling Rules
On the Expressive Power of Multiple Heads in CHR
ACM Transactions on Computational Logic (TOCL)
The expressive power of CHR with priorities
Information and Computation
| Hi-index | 0.00 |
Interesting subclasses of CHR are still Turing-complete: CHR with only one kind of rule, with only one rule, and propositional refined CHR. This is shown by programming a simulator of Turing machines (or Minsky machines) within those subclasses. Single-headed CHR without host language and propositional abstract CHR are not Turing-complete.