Abstract
In this paper, we propose a new and complete method based on narrowing for solving equations in equational theories. It is a combination of basic narrowing and narrowing with eager reduction, which is not obvious, because their naive combination is not a complete method. We show that it is more efficient than the existing methods in many cases, and for that establish commutation properties on the narrowing. It provides an algorithm that has been implemented as an extension of the REVE software.
This research was supported by the GRECO of programmation.
Chapter PDF
References
M. Fay: “First-Order Unification in An Equational Theory”, Master Thesis, U. of California At Santa Cruz, Tech. Report 78-5-002, May 1978.
M. Fay: “First-Order Unification in an Equational Theory”, Proceedings of the 4th Workshop on Automated Deduction, p. 161–167, Austin, Texas, 1979.
J. Goguen and J. Meseguer: “EQLOG: Equality, types, and generic Modules for logic programming”, in Functional and Logic Programming, D. DeGroot and G. Lindstrom, editors, Springer-Verlag, 1985.
A. Herold: “Narrowing techniques applied to idempotent unification”, SEKI report SR-86-16, August 1986.
G. Huet: “Résolution d'équations dans les langages d'ordre 1,2,...ω”, Thèse d'état, Université de Paris VII, 1976.
G. Huet and JJ. Levy: “Call by need Computations in Non-ambiguous Linear Term Rewriting Systems”, INRIA Laboria, report 359, 1979.
G. Huet and D. Oppen: “Equations and Rewrite Rules: A Survey”, in Formal Language Theory: Perspectives and Open Problems, ed. Book R, Academic Press, 1980.
J.M. Hullot: “Canonical Forms And Unification”, Proceedings of the Fifth Conference on Automated Deduction, Lecture Notes in Computer Science, vol 87, pp. 318–334, Springer-Verlag, Les Arcs, France, July 1980.
J.M. Hullot: “Compilation de Formes Canoniques dans les Théories Equationnelles”, Thèse de 3ème Cycle, Université de Paris Sud, 1980.
A. Josephson and N. Dershowitz: “Efficient Implementation of Narrowing: the RITE way”, in Proceedings of the International Conference of Logic Programming, Salk Lake City, 1986.
J.-P. Jouannaud, C. Kirchner, H. Kirchner: “Incremental Construction of Unification Algorithms in Equational Theories”, in Proceedings of the International Conference On Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 154, pp. 361–373, Springer-Verlag, Barcelona, 1983.
C. Kirchner: “Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles”, Thèse de doctorat d'Etat, Université de Nancy I, 1985.
H. Kirchner: “Preuves par complétion dans les variétés d'algèbres”, Thèse de doctorat d'Etat, Université de Nancy I, 1985.
P. Lescanne: “Computer experiments with the REVE term rewriting system generator”, in 10th ACM Conf. on Principles of Programming Languages, pp. 99–108, Austin Texas, January 1983.
G. Plotkin: “Building—in Equational Theories”, in Machine Intelligence, vol. 7, pp. 73–90, 1972.
U.S. Reddy: “On the relationship between logic and functional languages”, in Logic Programming: Relations, Functions, and Equations, D. DeGroot and G. Lindstrom, eds. Prentice Hall, Englewood Cliffs, NJ, 1985.
P. Réty, C. Kirchner, H. Kirchner, and P. Lescanne: “NARROWER: A new Algorithm for Unification and its application to Logic Programming”, Proc. Irst Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 141–157, Springer-Verlag, Dijon France, 1985.
P. Réty, C. Kirchner, H. Kirchner, and P. Lescanne: “NARROWER: An algorithm for unification based on narrowing”, CRIN report 86-R-131, 1986.
P. Réty: “Improving basic narrowing and commutation properties”, CRIN report 87-R-012, 1987.
J.R. Slagle: “Automated theorem-proving for theories with simplifiers, commutativity and associativity”, J. of ACM, vol 21, pp. 622–642, 1974.
G. Smolka: “Order-sorted Horn logic semantics and deduction”, Universitat Kaiserslautern, Internal report, September 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Réty, P. (1987). Improving basic narrowing techniques. In: Lescanne, P. (eds) Rewriting Techniques and Applications. RTA 1987. Lecture Notes in Computer Science, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17220-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-17220-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17220-8
Online ISBN: 978-3-540-47421-0
eBook Packages: Springer Book Archive