Conditions for confluence of innermost terminating term rewriting systems

DOI10.1007/s00200-018-0377-8zbMath1429.68088OpenAlexW2907092888MaRDI QIDQ2321950

Masahiko Sakai, Michio Oyamaguchi, Sayaka Ishizuki

Publication date: 27 August 2019

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-018-0377-8

zbMATH Keywords

decidabilityconfluenceterm rewriting systemsinnermost termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• AProVE
• CSI
• Saigawa

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Term-rewriting systems with rule priorities
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent
• Proving Confluence of Term Rewriting Systems Automatically
• Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
• CSI – A Confluence Tool
• The Confluence Problem for Flat TRSs

This page was built for publication: Conditions for confluence of innermost terminating term rewriting systems