Handbook of theoretical computer science (vol. B)
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
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
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Languages, Rewriting Systems, and Verification of Infinite-State Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Closure of Tree Automata Languages under Innermost Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Unique Normalization for Shallow TRS
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving Confluence of Term Rewriting Systems Automatically
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Information Processing Letters
Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Processes, Terms and Cycles
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-Linear Rewrite Closure and Weak Normalization
Journal of Automated Reasoning
| Hi-index | 0.00 |
We show that confluence of shallow and right-linear term rewriting systems is decidable. This class of rewriting system is expressive enough to include nontrivial nonground rules such as commutativity, identity, and idempotence. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving, which implies that its reachability and joinability problems are decidable. The new decidability result is obtained by building upon our prior work for the class of ground term rewriting systems and shallow linear term rewriting systems. The proof relies on the concept of extracting more general rewrite derivations from a given rewrite derivation.