A General Framework for R-Unification Problems
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Grid Structure and Undecidable Constraint Theories
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Solving Disequations Modulo Some Class of Rewrite Systems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
The First-Order Theory of One-Step Rewriting is Undecidable
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Undecidability of the First Order Theory of One-Step Right Ground Rewriting
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Weakly Regular Relations and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
The Existential Fragment of the One-Step Parallel Rewriting Theory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
We give a decision procedure for the whole existential fragment of one-step rewriting first-order theory, in the case where rewrite systems are linear, non left-left-overlapping (i.e. without critical pairs), and non Ɛ-left-right-overlapping (i.e. no left-hand-side overlaps on top with the right-hand-side of the same rewrite rule). The procedure is defined by means of tree-tuple synchronized grammars.