• search hit 1 of 2
Back to Result List

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

Download full text files

Export metadata

Metadaten
Author:Jürgen Avenhaus, Carlos Loría-Sáenz
URN:urn:nbn:de:hbz:386-kluedo-3156
Series (Serial Number):SEKI Report (93,3)
Document Type:Preprint
Language of publication:English
Year of Completion:1993
Year of first Publication:1993
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/04/03
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011