Complete equational unification based on an extension of the Knuth-Bendix completion procedure

  • Akihiko Ohsuga
  • Kô Sakai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 572)

Abstract

A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss a more semantical unifier: an equational unifier, which is a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general procedure that enumerates a complete set of equational unifiers for a given pair of terms under a given congruence.

Keywords

Inference Rule Congruence Relation Critical Pair Ground Term Fairness Condition 
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. [Bachmair 86]
    Bachmair, L., Dershowitz, N., and Hsiang, J.: Ordering for equational proof, Proc. Symp. Logic in Computer Science, Cambridge, Massachusetts (June 1986)Google Scholar
  2. [Bachmair 87]
    Bachmair, L., Dershowitz, N., and Plaisted, D. A.: Completion without failure, Proc. Colloquium on Resolution of Equations in Algebraic Structures (1987)Google Scholar
  3. [Bosco 87]
    Bosco, P. G., Giovannetti, F., and Moiso, C.: Refined strategies for equational proofs, TAPSOFT '87, LNCS 250, pp. 276–290 (1987)Google Scholar
  4. [Dershowitz 79]
    Dershowitz, N. and Manna, Z.: Proving termination with multiset orderings, Comm. ACM 22, pp. 465–467 (1979)Google Scholar
  5. [Dershowitz 82]
    Dershowitz, N.: Orderings for term-rewriting systems, Theoretical Computer Science 17, pp. 279–301 (1982)Google Scholar
  6. [Fages 84]
    Fages, F.: Associative-commutative unification, 7th International Conference on Automated Deduction, LNCS 170, pp. 194–208 (1984)Google Scholar
  7. [Fages 86]
    Fages, F. and Huet, G.: Complete sets of unifiers and matchers in equational theories, Theoretical Computer Science 43, pp. 189–200 (1986)Google Scholar
  8. [Fay 79]
    Fay, M.: First order unification in an equational theory, 4th workshop on Automated Deduction, Austin, Texas, pp. 161–167 (1979)Google Scholar
  9. [Gallier 87]
    Gallier, J. H. and Snyder, W.: A general complete E-unification procedure, Rewriting Techniques and Applications, LNCS 256, pp. 216–227 (1987)Google Scholar
  10. [Hsiang 87]
    Hsiang, J.: Rewrite method for theorem proving in first order theory with equality, J. Symbolic Computation, 3, 133–151 (1987)Google Scholar
  11. [Huet 78]
    Huet, G.: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations, Inform. Process. Lett. 7, pp. 144–147 (1978)Google Scholar
  12. [Huet 80]
    Huet, G. and Oppen, D. C.: Equations and Rewrite Rules: a survey, Formal Language: Perspectives and Open Problems Academic Press, pp. 349–405 (1980)Google Scholar
  13. [Huet 81]
    Huet, G.: A complete proof of correctness of the Knuth-Bendix completion algorithm, J. Computer and System Science 23, pp. 11–21 (1981)Google Scholar
  14. [Hullot 80]
    Hullot, J. M.: Canonical forms and unification, 5th Workshop on Automated Deduction, LNCS 87, pp. 318–334 (1980)Google Scholar
  15. [Knuth 70]
    Knuth, D. E. and Bendix, P. B.: Simple word problems in universal algebras, Computational problems in abstract algebra, Pergamon Press, Oxford (1970)Google Scholar
  16. [Makanin 77]
    Makanin, G. S.: The problem of solvability of equations in a free semigroup, Soviet Akad. Nauk SSSR, Tom 233, No. 2 (1977)Google Scholar
  17. [Robinson 65]
    Robinson, J. A.: A machine-oriented logic based on the resolution principle, J. ACM 12, pp. 23–41 (1965)Google Scholar
  18. [Rusinowitch 88]
    Rusinowitch, M.: Theorem-proving with resolution and superposition: an extension of the Knuth and Bendix procedure to acomplete set of inference rules, International Conference on Fifth Generation Computer Systems, 1988, pp. 524–531 (1988)Google Scholar
  19. [Sakai 84]
    Sakai, K.: An ordering method for term rewriting systems, Technical Report 062, ICOT (1984)Google Scholar
  20. [Siekmann 89]
    Siekmann, J. H.: Unification theory, J. Symbolic Computation 7, pp. 207–274 (1989)Google Scholar
  21. [Smullyan 85]
    Smullyan, R. M.: To Mock a Mockingbird, Alfred A. Knopf, Inc. (1985)Google Scholar
  22. [Stickel 81]
    Stickel, M.E.: A unification algorithm for associative-commutative functions, J. ACM, 28, 3, pp. 423–434 (1981)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Akihiko Ohsuga
    • 1
  • Kô Sakai
    • 2
  1. 1.Toshiba CorporationKawasaki-shiJapan
  2. 2.ICOT Research CenterTokyoJapan

Personalised recommendations