Computer Science – Logic in Computer Science
Scientific paper
2012-03-22
LMCS 8 (1:31) 2012
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-8(1:31)2012
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 it also (partially) works even if the system is not terminating modulo E. We first present confluence criteria for term rewriting systems whose rewrite rules can be partitioned into a terminating part and a 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.
Aoto Takahito
Toyama Yoshihito
No associations
LandOfFree
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-471304