Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent

Authors:
Masahiko Sakai;Mizuhito Ogawa
Affiliations:
Graduate School of Information Science, Nagoya University, Furo-cho Chikusa-ku Nagoya, 464-8603 Japan;Japan Advanced Institute of Science and Technology, 1-1 Asahidai Nomi Ishikawa, 923-1292 Japan
Venue:
Information Processing Letters
Year:
2010

Citing 10
Cited 0

Term rewriting and all that

Term rewriting and all that
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Simultaneous Critical Pairs and Church-Rosser Property

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Development Closed Critical Pairs

HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Confluence without Termination via Parallel Critical Pairs

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Undecidable Properties on Length-Two String Rewriting Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Confluence of shallow right-linear rewrite systems

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
The confluence problem for flat TRSs

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper shows that weakly-non-overlapping, non-collapsing and shallow term rewriting systems are confluent, which is a new sufficient condition on confluence for non-left-linear systems.