Other presentations

  1. Decidability properties for fragments of CHR

    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 gt;0$). Both languages allow the use of the $=$ built-in in the body of rules, thus are built on …

    read more

Page 1 / 1

hosted by