The Church-Rosser property for ground term-rewriting systems is decidable
Theoretical Computer Science
Information and Computation
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Canonical Equational Proofs
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Algorithms and Reductions for Rewriting Problems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
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
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
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
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Confluence of shallow right-linear rewrite systems
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
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
| Hi-index | 0.00 |
We show that the confluence of shallow linear term rewrite systems is decidable. The decision procedure is a nontrivial generalization of the polynomial time algorithms for deciding confluence of ground and restricted non-ground term rewrite systems presented in [13,2]. Our algorithm has a polynomial time complexity if the maximum arity of a function symbol in the signature is considered a constant.We also give EXPTIME-hardness proofs for reachability and confluence of shallow term rewrite systems.