Classes of term rewrite systems with polynomial confluence problems

DOI10.1145/976706.976712MaRDI QIDQ5277699zbMATH OpenOpenAlexFDO

Authors Guillem Godoy, Robert Nieuwenhuis, Ashish Tiwari

Publication date 12 July 2017

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

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

zbMATH Keywords

confluencerewriting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• Deciding confluence of certain term rewriting systems in polynomial time
• scientific article; zbMATH DE number 1962804
• Deciding confluence of ground term rewrite systems in cubic time
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Computer Science Logic

Cited in

(7)

• Deciding confluence of certain term rewriting systems in polynomial time
• Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent
• scientific article; zbMATH DE number 1962804 (Why is no real title available?)
• Deciding confluence of ground term rewrite systems in cubic time
• Deciding the confluence of ordered term rewrite systems
• The Confluence Problem for Flat TRSs
• Computer Science Logic

This page was built for publication: Classes of term rewrite systems with polynomial confluence problems

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