## Canonical Conditional Rewrite Systems Containing Extra Variables

• 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

### Additional Services

Author: Jürgen Avenhaus, Carlos Loría-Sáenz urn:nbn:de:hbz:386-kluedo-3156 SEKI Report (93,3) Preprint English 1993 1993 Technische Universität Kaiserslautern Fachbereich Informatik 004 Datenverarbeitung; Informatik

$Rev: 12793$