Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams

DOI10.1007/978-3-319-08918-8_4zbMath1416.68088OpenAlexW2146294372MaRDI QIDQ5170807

Kazumasa Uchida, Takahito Aoto, Yoshihito Toyama

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08918-8_4

zbMATH Keywords

confluencepersistencyterm rewriting systemsnon-lineardecreasing diagramsrule- labelling

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Conditions for confluence of innermost terminating term rewriting systems

This page was built for publication: Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams