TY - INPR
A1 - Avenhaus, Jürgen
A1 - Loría-Sáenz, Carlos
T1 - Canonical Conditional Rewrite Systems Containing Extra Variables
N2 - We study deterministic conditional rewrite systems, i.e. conditional rewrite systemswhere the extra variables are not totally free but 'input bounded'. If such a systemR is quasi-reductive then !R is decidable and terminating. We develop a critical paircriterion to prove confluence if R is quasi-reductive and strongly deterministic. In thiscase we prove that R is logical, i.e./!R==R holds. We apply our results to proveHorn clause programs to be uniquely terminating.This research was supported by the Deutsche Forschungsgemeinschaft, SFB 314, Project D4
T3 - SEKI Report - 93,3
Y1 - 1993
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/344
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-3156
ER -