Confluence of right ground term rewriting systems is decidable
From MaRDI portal
Recommendations
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- scientific article; zbMATH DE number 3928342
- On ground-confluence of term rewriting systems
- Deciding confluence of certain term rewriting systems in polynomial time
- scientific article; zbMATH DE number 165818
Cited in
(14)- The Church-Rosser property for ground term-rewriting systems is decidable
- The unification problem for confluent right-ground term rewriting systems.
- Characterizing confluence by rewrite closure and right ground term rewrite systems
- Deciding confluence of certain term rewriting systems in polynomial time
- Rational term rewriting revisited: decidability and confluence
- scientific article; zbMATH DE number 5708984 (Why is no real title available?)
- scientific article; zbMATH DE number 3928342 (Why is no real title available?)
- scientific article; zbMATH DE number 165818 (Why is no real title available?)
- Decidability of confluence and termination of monadic term rewriting systems
- Deciding the confluence of ordered term rewrite systems
- Automated Reasoning
- Computer Science Logic
- Tail reduction free term rewriting systems revisited
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
This page was built for publication: Confluence of right ground term rewriting systems is decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705906)