Skip to main content
Conference Proceedings

Turing-complete subclasses of CHR

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5366 LNCS 759-763
DOI: 10.1007/978-3-540-89982-2_72
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sneyers, J. (2008). Turing-complete subclasses of CHR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5366 LNCS, pp. 759–763). https://doi.org/10.1007/978-3-540-89982-2_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free