Improving basic narrowing techniques

  • Pierre Réty
Unification By Narrowing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 256)


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.


Normal Form Logic Program Equational Theory Basic Derivation Commutation Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    M. Fay: “First-Order Unification in An Equational Theory”, Master Thesis, U. of California At Santa Cruz, Tech. Report 78-5-002, May 1978.Google Scholar
  2. [2]
    M. Fay: “First-Order Unification in an Equational Theory”, Proceedings of the 4th Workshop on Automated Deduction, p. 161–167, Austin, Texas, 1979.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    A. Herold: “Narrowing techniques applied to idempotent unification”, SEKI report SR-86-16, August 1986.Google Scholar
  5. [5]
    G. Huet: “Résolution d'équations dans les langages d'ordre 1,2,...ω”, Thèse d'état, Université de Paris VII, 1976.Google Scholar
  6. [6]
    G. Huet and JJ. Levy: “Call by need Computations in Non-ambiguous Linear Term Rewriting Systems”, INRIA Laboria, report 359, 1979.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    J.M. Hullot: “Compilation de Formes Canoniques dans les Théories Equationnelles”, Thèse de 3ème Cycle, Université de Paris Sud, 1980.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    G. Plotkin: “Building—in Equational Theories”, in Machine Intelligence, vol. 7, pp. 73–90, 1972.Google Scholar
  16. [16]
    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.Google Scholar
  17. [17]
    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.Google Scholar
  18. [18]
    P. Réty, C. Kirchner, H. Kirchner, and P. Lescanne: “NARROWER: An algorithm for unification based on narrowing”, CRIN report 86-R-131, 1986.Google Scholar
  19. [19]
    P. Réty: “Improving basic narrowing and commutation properties”, CRIN report 87-R-012, 1987.Google Scholar
  20. [20]
    J.R. Slagle: “Automated theorem-proving for theories with simplifiers, commutativity and associativity”, J. of ACM, vol 21, pp. 622–642, 1974.Google Scholar
  21. [21]
    G. Smolka: “Order-sorted Horn logic semantics and deduction”, Universitat Kaiserslautern, Internal report, September 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Pierre Réty
    • 1
  1. 1.Centre de Recherche en Informatique de NancyVandoeuvre Les Nancy CedexFrance

Personalised recommendations