Deciding confluence and normal form properties of ground term rewrite systems efficiently
From MaRDI portal
Publication:4553285
Recommendations
- Deciding confluence of ground term rewrite systems in cubic time
- Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
- Deciding confluence of certain term rewriting systems in polynomial time
- A new decidability technique for ground term rewriting systems with applications
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
Cites work
- scientific article; zbMATH DE number 3928342 (Why is no real title available?)
- scientific article; zbMATH DE number 1962804 (Why is no real title available?)
- scientific article; zbMATH DE number 6792369 (Why is no real title available?)
- Algorithms and reductions for rewriting problems
- CSI: new evidence -- a progress report
- Comparing curried and uncurried rewriting
- Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
- Confluence of curried term-rewriting systems
- Deciding confluence of certain term rewriting systems in polynomial time
- Deciding confluence of ground term rewrite systems in cubic time
- Fast Decision Procedures Based on Congruence Closure
- Fast congruence closure and extensions
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Modular properties of conditional term rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- On the modularity of normal forms in rewriting
- Polynomial time termination and constraint satisfaction tests
- Term Rewriting and All That
- Unique Normalization for Shallow TRS
Cited in
(5)- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
- Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
- Trace rewriting: Computing normal forms in time O(n log n)
- A new decidability technique for ground term rewriting systems with applications
- Deciding confluence of ground term rewrite systems in cubic time
This page was built for publication: Deciding confluence and normal form properties of ground term rewrite systems efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553285)
