Deciding confluence of ground term rewrite systems in cubic time

DOI10.4230/LIPICS.RTA.2012.165zbMATH Open1437.68079OpenAlexW575118053MaRDI QIDQ5111903FDOQ5111903

Bertram Felgenhauer

Publication date: 27 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/rta/rta2012.html#Felgenhauer12

Recommendations

• Deciding confluence of certain term rewriting systems in polynomial time
• Deciding confluence and normal form properties of ground term rewrite systems efficiently
• Classes of term rewrite systems with polynomial confluence problems
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• scientific article; zbMATH DE number 1962804

zbMATH Keywords

decidabilityconfluenceterm rewritingground terms

Mathematics Subject Classification ID

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

Cited In (5)

• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
• Deciding confluence of certain term rewriting systems in polynomial time
• Title not available (Why is that?)
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Title not available (Why is that?)

This page was built for publication: Deciding confluence of ground term rewrite systems in cubic time

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