The reachability and joinability problems for right-ground term-rewriting systems
Journal of Information Processing
Handbook of theoretical computer science (vol. B)
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Lazy narrowing: strong completeness and eager variable elimination
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
A deterministic lazy narrowing calculus
Journal of Symbolic Computation
Unification in Extension of Shallow Equational Theories
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Information Processing Letters
| Hi-index | 0.00 |
The unification problem for term rewriting systems (TRSs) is the problem of deciding, for a given TRS R and two terms M and N, whether there exists a substitution θ such that Mθ and Nθ are congruent modulo R (i.e., Mθ ↔R* Nθ). In this paper, the unification problem for confluent right-ground TRSs is shown to be decidable. To show this, the notion of minimal terms is introduced and a new unification algorithm for obtaining a substitution whose range consists of minimal terms is proposed. Our result extends the decidability of unification for canonical (i.e., terminating and confluent) right-ground TRSs given by Hullot [Proceedings of the 5th Conference on Automated Deduction, LNCS, vol. 87, 1980, p. 318] in the sense that the termination condition can be omitted.