Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T02:59:40.205Z Has data issue: false hasContentIssue false

Decidability properties for fragments of CHR

Published online by Cambridge University Press:  09 July 2010

MAURIZIO GABBRIELLI
Affiliation:
Dipartimento di Scienze dell'Informazione and Lab. Focus INRIA, Università di Bologna, Italy (e-mail: gabbri@cs.unibo.it)
JACOPO MAURO
Affiliation:
Dipartimento di Scienze dell'Informazione, Università di Bologna, Italy (e-mail: jmauro@cs.unibo.it)
MARIA CHIARA MEO
Affiliation:
Dipartimento di Scienze, Università di Chieti Pescara, Italy (e-mail: cmeo@unich.it)
JON SNEYERS
Affiliation:
Departement Computerwetenschappen, K.U. Leuven, Belgium (e-mail: jon.sneyers@cs.kuleuven.be)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols (of arity > 0). Both languages allow the use of the = built-in in the body of rules, thus are built on a host language that supports unification. However each imposes one further restriction. The first CHR dialect allows only range-restricted rules, that is, it does not allow the use of variables in the body or in the guard of a rule if they do not appear in the head. We show that the existence of an infinite computation is decidable for this dialect. The second dialect instead limits the number of atoms in the head of rules to one. We prove that in this case, the existence of a terminating computation is decidable. These results show that both dialects are strictly less expressive1 than Turing Machines. It is worth noting that the language (without function symbols) without these restrictions is as expressive as Turing Machines.

Information

Type
Regular Papers
Copyright
Copyright © Cambridge University Press 2010