When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2011.91
URN: urn:nbn:de:0030-drops-31105
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3110/
 Go to the corresponding LIPIcs Volume Portal

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems

 pdf-format:

Abstract

We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critical pairs and usual termination. We first present confluence criteria for term rewriting systems whose rewrite rules can be partitioned into terminating part and possibly non-terminating part. We then give a reduction-preserving completion procedure so that the applicability of the criteria is enhanced. In contrast to the well-known Knuth-Bendix completion procedure which preserves the equivalence relation of the system, our completion procedure preserves the reduction relation of the system, by which confluence of the original system is inferred from that of the completed system.

BibTeX - Entry

```@InProceedings{aoto_et_al:LIPIcs:2011:3110,
author =	{Takahito Aoto and Yoshihito Toyama},
title =	{{A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems}},
booktitle =	{22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages =	{91--106},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-30-9 },
ISSN =	{1868-8969},
year =	{2011},
volume =	{10},
editor =	{Manfred Schmidt-Schau{\ss}},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},