Deciding the confluence of ordered term rewrite systems

DOI10.1145/601775.601777zbMATH Open1365.68298OpenAlexW1987538043MaRDI QIDQ5267423FDOQ5267423

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

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

zbMATH Keywords

confluencerewrite systemspath orderingsordered rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (8)

• The Confluence Problem for Flat TRSs
• Deciding confluence for a simple class of relational transducer networks
• Ordered rewriting and confluence
• Could orders be captured by term rewriting systems?
• Confluence of orthogonal term rewriting systems in the prototype verification system
• Twee: an equational theorem prover
• On the Expressivity of Optimality Theory versus Ordered Rewrite Rules
• Title not available (Why is that?)

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)