On Semi-Completeness of Term Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

On Semi-Completeness of Term Rewriting Systems


We investigate the question whether semi-completeness, i.e., weak termination plus confluence, of term rewriting systems is preserved under the normalization of right-hand sides. We give a simple counterexample showing that in general this transformation neither preserves weak termination nor (local) confluence. Moreover we present two conditions which are sufficient for the preservation of semi-completeness. In particular, we show that (almost) orthogonal systems enjoy this preservation property.
Fichier principal
Vignette du fichier
RR-3327.pdf (209.62 Ko) Télécharger le fichier

Dates and versions

inria-00073362 , version 1 (24-05-2006)


  • HAL Id : inria-00073362 , version 1


Bernhard Gramlich. On Semi-Completeness of Term Rewriting Systems. [Research Report] RR-3327, INRIA. 1997, pp.11. ⟨inria-00073362⟩
136 View
121 Download


Gmail Facebook Twitter LinkedIn More