Generally speaking, confluence property is not preserved when Term Rewriting Systems (TRSs) are combined, even if they are canonical. In this paper we give some sufficient conditions for ensuring the confluence property of combined left linear, overlapping TRSs.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Bachmair, L. and Dershowitz, N., Commutation, transformation, and termination. Proceedings of the 8th International Conference on Automated Deduction, Oxford, England. LNCS 230, 5–20, 1986.
Bauer, F. and Otto, F., Finite complete rewriting systems and the complexity of the word problem.Acta Informatica,21:5 (1984), 521–540.
Dershowitz, N, Termination of rewriting.Journal of Symbolic Computation,3 (1987), 69–116.
Heut, G., Confluent reductions: Abstract properties and applications to term rewriting systems.JACM,27:4 (1980), 797-821.
Heut, G. and Oppen, D. C., Equations and rewrite rules: A survey. InFormal Language Theory: Prospectives and Open Problems, Book, R., ed., New York: Academic Press, 1987, 349–405.
Klop, J. W., Combinatory reduction systems. Dissertation, Univ. of Utrecht, The Netherlands, 1980.
Knuth, D.E. and Bendix, P., Simple word problems in Universal algebras. InComputational problems in abstract algebra, J. Leech, ed., Pergamon Press, Elmsford, N. Y., 1970, 263–297.
Raoult, J. C. and Vuillemin, J., Operational and semantic equivalence between recursive programs.JACM,27:4 (1980), 772–796.
Rosen, B. K., Tree-manipulating systems and Church-Rosser theorems.JACM,20: 1 (1973), 160–187.
Staple, J., Church-Rosser Theorem for Replacement Systems. LNM 450, 1975, 291–307.
Toyama, Y., On the Church-Rosser property for the direct sum of term, rewriting systems.JACM,34:1 (1987), 128–143.
This work was supported partly by The National Science Foundation, The Ministry of Electronic Industries and High Technology Program under The National Commission of Science & Technology
About this article
Cite this article
Xubo, Z. Some results on the confluence property of combined Term Rewriting Systems. J. of Comput. Sci. & Technol. 6, 291–295 (1991). https://doi.org/10.1007/BF02945519
- Word Problem
- Function Symbol
- Critical Pair
- Replacement System
- Solve Word Problem