Deciding the confluence of ordered term rewrite systems

DOI10.1145/601775.601777MaRDI QIDQ5267423zbMATH OpenOpenAlexFDO

Authors Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch

Publication date 13 June 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/601775.601777

zbMATH Keywords

confluenceordered rewritingpath orderingsrewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Ordered rewriting and confluence
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Deciding confluence of certain term rewriting systems in polynomial time
• Foundations of Software Science and Computational Structures
• Classes of term rewrite systems with polynomial confluence problems

Cited in

(10)

• Twee: an equational theorem prover
• Confluence of orthogonal term rewriting systems in the prototype verification system
• Deciding confluence for a simple class of relational transducer networks
• scientific article; zbMATH DE number 176122 (Why is no real title available?)
• The Confluence Problem for Flat TRSs
• On the Expressivity of Optimality Theory versus Ordered Rewrite Rules
• Could orders be captured by term rewriting systems?
• Ordered rewriting and confluence
• Term ordering diagrams
• Partial redundancy in saturation

This page was built for publication: Deciding the confluence of ordered term rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267423)