Advertisement

Canonical forms and unification

  • Jean-Marie Hullot
Friday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 87)

Abstract

Fay has described in [2,3] a complete T-unification for equational theories T which possess a complete set of reductions as defined by Knuth & Bendix [12]. This algorithm relies essentially on using the narrowing process defined by Lankford [13]. In this paper, we first study the relations between narrowing and unification and we give a new version of Fay's algorithm. We then show how to eliminate many redundancies in this algorithm and give a sufficient condition for the termination of the algorithm. In a last part, we show how to extend the previous results to various kinds of canonical term rewriting systems.

Keywords

Normal Form Decision Procedure Equational Theory Unification Algorithm Minimum Unifier 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ballantyne A.M. and Lankford D.S., New Decision Algorithms for Finitely Presented Commutative Semigroups. Report MTP-4, Department of Mathematics, Louisiana Tech. U., May 1979.Google Scholar
  2. 2.
    Fay M., First-order Unification in an Equational Theory. Master Thesis, U. of California at Santa Cruz. Tech. Report 78-5-002, May 1978.Google Scholar
  3. 3.
    Fay M., First-order Unification in an Equational Theory. 4th Workshop on Automated Deduction, Austin, Texas, Feb. 1979, 161–167.Google Scholar
  4. 4.
    Huet G., A Unification Algorithm for Typed Lambda Calculus. Theoretical Computer Science, 1,1 (1975), 27–57.CrossRefGoogle Scholar
  5. 5.
    Huet G., Résolution d'équations dans des langages d'ordre 1, 2, ..., ω. Thèse d'Etat, Université de Paris VII, 1976.Google Scholar
  6. 6.
    Huet G., Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. 18th IEEE Symposium on Foundations of Computer Science (1977), 30–45.Google Scholar
  7. 7.
    Huet G., Embedding Equational Theories in Complete Sets of Reductions. Unpublished manuscript, 1979.Google Scholar
  8. 8.
    Huet G. and Lévy J.J., Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems. Rapport Laboria 359, IRIA, Août 1979.Google Scholar
  9. 9.
    Huet G. and Oppen D.C., Equations and Rewrite Rules: a Survey. In “Formal Languages: Perspectives and Open Problems”. Ed. Book R., Academic press 1980.Google Scholar
  10. 10.
    Hullot J.M., Associative-Commutative Pattern Matching. Fifth International Joint Conference on Artificial Intelligence, Tokyo, 1979.Google Scholar
  11. 11.
    Hullot J.M., A Catalogue of Canonical Term Rewriting Systems. Unpublished manuscript, March 1980.Google Scholar
  12. 12.
    Knuth D. and Bendix P., Simple Word Problems in Universal Algebras. “Computational Problems in Abstract Algebra”. Ed. Leech J., Pergamon Press, 1970, 263–297.Google Scholar
  13. 13.
    Lankford D.S., Canonical Inference. Report ATP-32, Departments of Mathematics and Computer Sciences, University of Texas at Austin, Dec. 1975.Google Scholar
  14. 14.
    Lankford D.S., A Unification Algorithm for Abelian Group Theory. Report MTP-1, Math. Dept., Louisiana Tech. U., Jan. 1979.Google Scholar
  15. 15.
    Lankford D.S., Private Communication. 1980.Google Scholar
  16. 16.
    Lankford D.S. and Ballantyne A.M., Decision Procedures for Simple Equational Theories With Commutative Axioms: Complete Sets of Commutative Reductions. Report ATP-35, Departments of Mathematics and Computer Sciences, U. of Texas at Austin, March 1977.Google Scholar
  17. 17.
    Lankford D.S. and Ballantyne A.M., Decision Procedures for Simple Equational Theories With Permutative Axioms: Complete Sets of Permutative Reductions. Report ATP-37, Departments of Mathematics and Computer Sciences, U. of Texas at Austin, April 1977.Google Scholar
  18. 18.
    Lankford D.S. and Ballantyne A.M., Decision Procedures for Simple Equational Theories With Commutative-Associative Axioms: Complete Sets of Commutative-Associative Reductions. Report ATP-39, Departments of Mathematics and Computer Sciences, U. of Texas at Austin, Aug. 1977.Google Scholar
  19. 19.
    Lankford D.S. and Ballantyne A.M., The Refutation Completeness of Blocked Permutative Narrowing and Resolution. Fourth Conference on Automated Deduction, Austin, Feb. 1979, 53–59.Google Scholar
  20. 20.
    Livesey M. and Siekmann J., Unification of Sets. Internal Report 3/76, Institut fur Informatik I, U. Karlsruhe, 1977.Google Scholar
  21. 21.
    Makanin G.S., The Problem of Solvability of Equations in a Free Semigroup. Akad. Nauk. SSSR, TOM 233,2 (1977).Google Scholar
  22. 22.
    Martelli A. and Montanari U., An Efficient Unification Algorithm. Unpublished manuscript, 1979.Google Scholar
  23. 23.
    Paterson M.S. and Wegman M.N., Linear Unification. J. of Computer and Systems Sciences 16 (1978), 158–167.CrossRefGoogle Scholar
  24. 24.
    Peterson G.E. and Stickel M.E., Complete Sets of Reductions for Equational Theories With Complete Unification Algorithms. Tech. Report, Dept. of Computer Science, U. of Arizona, Tucson, Sept. 1977.Google Scholar
  25. 25.
    Plotkin G., Building-in Equational Theories. Machine Intelligence 7 (1972), 73–90.Google Scholar
  26. 26.
    Raulefs P. and Siekmann J., Unification of Idempotent Functions. Unpublished manuscript, 1978.Google Scholar
  27. 27.
    Robinson J.A., A Machine-Oriented Logic Based on the Resolution Principle. JACM 12 (1965), 32–41.CrossRefGoogle Scholar
  28. 28.
    Slagle J.R., Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. JACM 21 (1974), 622–642.CrossRefGoogle Scholar
  29. 29.
    Stickel M.E., A Complete Unification Algorithm for Associative-Commutative Functions. 4th International Joint Conference on Artificial Intelligence, Tbilisi, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Jean-Marie Hullot

There are no affiliations available

Personalised recommendations