Proceedings of the 24th International Conference on Logic Programming, LNCS vol:5366 pages:759-763
International Conference on Logic Programming edition:24 location:Udine, Italy date:9-13 December 2008
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.