Advertisement

Higher-order and semantic unification

  • Nachum Dershowitz
  • Subrata Mitra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 761)

Abstract

We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard unification procedure, with slight modifications, can be used to solve the satisfiability problem in combinatory logic with a convergent set of algebraic axioms R, thus resulting in a complete higher-order unification procedure for R. Furthermore, we use the system of transformation rules to provide a syntactic characterization for R which results in decidability of semantic unification.

Keywords

Transformation Rule Regular Language Combinatory Logic Unification Procedure Satisfiability Problem 
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. [Bre88]
    V. Breazu-Tannen. Combining Algebra and Higher-order Types. In Proc. of the Third Annual IEEE Symposium on Logic in Computer Science, pages 82–90, 1988.Google Scholar
  2. [CR91]
    J. Chabin and P. Réty. Narrowing Directed by a Graph of Terms. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 112–123, of Lecture Notes in Computer Science, Springer Verlag, 1990.Google Scholar
  3. [DJ90]
    Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 243–320, North-Holland, Amsterdam, 1990.Google Scholar
  4. [DMS90]
    Nachum Dershowitz, Subrata Mitra and G. Sivakumar. Equation Solving in Conditional AC-Theories. In Proceedings of the Second International Conference on Algebraic and Logic Programming, Nancy, France, October 1990. Vol. 463, pages 283–297, of Lecture Notes in Computer Science, Springer Verlag (1990).Google Scholar
  5. [DMS92]
    Nachum Dershowitz, Subrata Mitra, and G. Sivakumar. Decidable matching for convergent systems. In Proceedings of the Eleventh Conference on Automated Deduction, pages 589–602, Saratoga Springs, NY, June 1992. Vol. 607 of Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin.Google Scholar
  6. [DS87]
    Nachum Dershowitz and G. Sivakumar. Solving Goals in Equational Languages. In Proceedings of the First International Workshop Conditional Term Rewriting System, Orsay, France, July 1987. Vol. 308, pages 45–55, of Lecture Notes in Computer Science, Springer Verlag (1987).Google Scholar
  7. [Dou91]
    D. J. Dougherty. Adding Algebra to the Untyped Lambda Calculus. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 37–48, of Lecture Notes in Computer Science, Springer Verlag, 1990.Google Scholar
  8. [Dou93]
    D. J. Dougherty. Higher-order unification via combinators. Theoretical Computer Science 114, pages 273–298.Google Scholar
  9. [DJ92]
    Daniel J. Dougherty and Patricia Johann. A Combinatory Logic Approach to Higher-order E-unification. In Proc. of the Eleventh Conference on Automated Deduction, Saratoga Springs, New York, June, 1992. Vol. 607, pages 79–93, of Lecture Notes in Computer Science, Springer Verlag, 1992.Google Scholar
  10. [Hul80]
    Jean-Marie Hullot. Canonical forms and unification. In R. Kowalski, editor, Proc. of the Fifth International Conference on Automated Deduction, pages 318–334, Les Arcs, France, July 1980. Vol. 87 of Lecture Notes in Computer Science, Springer, Berlin.Google Scholar
  11. [NQ91]
    T. Nipkow and Z. Qian. Modular Higher-order E-Unification. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 200–214, of Lecture Notes in Computer Science, Springer Verlag, 1990.Google Scholar
  12. [Ret87]
    Pierre Réty. Improving Basic Narrowing Techniques. In P. Lescanne,. editor, Proc. of the Second International Conference on Rewriting Techniques and Applications, pages 228–241, Bordeaux, France, May 1987. Vol. 256 of Lecture Notes in Computer Science, Springer, Berlin.Google Scholar
  13. [Sny90]
    Wayne Snyder. Higher Order E-Unification. In Proceedings of the Tenth Int. Conference on Automated Deduction, Kaiserslautern, FRG, July 1990. Vol. 449, pages 573–587, of Lecture Notes in Computer Science, Springer Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Nachum Dershowitz
    • 1
  • Subrata Mitra
    • 1
  1. 1.Department of Computer ScienceUniversity of IllinoisUrbanaUSA

Personalised recommendations