Title: Turing-complete subclasses of CHR
Authors: Sneyers, Jon # ×
Issue Date: Dec-2008
Publisher: Springer-Verlag
Host Document: Proceedings of the 24th International Conference on Logic Programming, LNCS vol:5366 pages:759-763
Conference: International Conference on Logic Programming edition:24 location:Udine, Italy date:9-13 December 2008
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.
ISBN: 978-3-540-89981-5
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
iclp08_tc_chr.pdfMain article Published 109KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science