Deciding the confluence of ordered term rewrite systems
From MaRDI portal
Publication:5267423
DOI10.1145/601775.601777zbMATH Open1365.68298OpenAlexW1987538043MaRDI QIDQ5267423FDOQ5267423
Paliath Narendran, Robert Nieuwenhuis, Hubert Comon, 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
Cited In (7)
- 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)
