Skip to Main content Skip to Navigation
Reports

On Semi-Completeness of Term Rewriting Systems

Bernhard Gramlich 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073362
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:37:17 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:43:56 PM

Identifiers

  • HAL Id : inria-00073362, version 1

Collections

Citation

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

Share

Metrics

Record views

287

Files downloads

197