Unification of infinite sets of terms schematized by primal grammars
Theoretical Computer Science
The first-order theory of linear one-step rewriting is undecidable
Theoretical Computer Science - Special issue on rewriting techniques and applications
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On Partial Validation of Logic Programs
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
A General Framework for R-Unification Problems
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
E-Unification by Means of Tree Tuple Synchronized Grammars
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Grid Structure and Undecidable Constraint Theories
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A New Result about the Decidability of the Existential One-Step Rewriting Theory
RtA '99 Proceedings of the 10th 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
TTSLI: An Implementation of Tree-Tuple Synchronized Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.