Searching for "Decidability of the Confluence of Ground Term Rewriting Systems" – sorted by Relevance.
-
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
- polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision
- Cited by 3 (1 self) – Add To MetaCart
-
Classes of Term Rewrite Systems with Polynomial Confluence Problems
- 94025 The confluence property of ground (i.e., variable-free) term rewrite systems (TRS) is well
- Cited by 2 (0 self) – Add To MetaCart

