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.
Type de document :
Rapport
[Research Report] RR-3327, INRIA. 1997, pp.11
Liste complète des métadonnées

https://hal.inria.fr/inria-00073362
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:37:17
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:43:56

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

145

Téléchargements de fichiers

111