The Church-Rosser property for ground term-rewriting systems is decidable
Theoretical Computer Science
Information and Computation
The reachability and joinability problems for right-ground term-rewriting systems
Journal of Information Processing
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms and Reductions for Rewriting Problems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Unique Normalization for Shallow TRS
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Levels of undecidability in rewriting
Information and Computation
Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Confluence of right ground term rewriting systems is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Confluence of shallow right-linear rewrite systems
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
| Hi-index | 0.89 |
Ground reachability, ground joinability and confluence are shown undecidable for flat term rewriting systems, i.e., systems in which all left and right members of rule have depth at most one.