Skip to main content
SpringerLink
Log in
Book cover

HOL Users' Group Workshop

HUG 1993: Higher Order Logic Theorem Proving and Its Applications pp 437–449Cite as

AC unification in HOL90

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 780))

Abstract

We report on an implementation of associative-commutative unification in an LCF-style theorem prover. We show how this algorithm can be used to implement rewriting modulo associativity and commutativity. This is an example of the sound incorporation of automatic first order methods into an interactive higher-order logic theorem prover.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Boudet, E. Contejean, and H. Devie. A new AC unification algorithm with an algorithm for solving systems of Diophantine equations. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 289–299, Philadelphia, Pennsylvania, June 1990. Computer Society Press.

    Google Scholar 

  2. Hans-Juergen Buerckert, Alexander Herold, Deepak Kapur, Jorg Siekmann, Mark Stickel, Michael Tepp, and Hantao Zhang. Opening the AC-unification race. Technical Report SR-88-11, SEKI, July, 1988.

    Google Scholar 

  3. Francois Fages. Associative-commutative unification. In Robert Shostak, editor, Proceedings of the Seventh International Conference on Automated Deduction (LNCS 170), pages 194–208, Napa, California, USA, May 1984. Springer-Verlag.

    Google Scholar 

  4. Albrecht Fortenbacher. An algebraic approach to unification under associativity and commutativity. In Jean-Pierre Jouannaud, editor, Proceeding of the First International Conference on Rewriting Techniques and Applications (LNCS 202), pages 381–397, Dijon, France, May 1985. Springer-Verlag.

    Google Scholar 

  5. Mike Gordon and Tom Melham. Introduction to HOL, a theorem proving environment for higher order logic. Cambridge University Press, 1993.

    Google Scholar 

  6. Michael Gordon. Note to info-hol mailing list, archive number 0914. Tagging theorems for proof acceleration, January 1993.

    Google Scholar 

  7. John Harrison and Laurent Thery. Extending the hol theorem prover with a computer algebra system to reason about the reals. In LPAR 93 (LNCS??), St. Petersburg, Russia, 1993.

    Google Scholar 

  8. Gerard Huet. An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations. Information Processing Letters, 7(3): 144–147, April 1978.

    Google Scholar 

  9. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. Technical Report 561, Unite' Associee' au CNRS UA 410, March 1990.

    Google Scholar 

  10. Deepak Kapur and Paliath Narendran. Double-exponential complexity of computing a complete set of AC-unifiers. In Proceeding of the Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, June 1992. Computer Society Press.

    Google Scholar 

  11. Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In Peter Schroeder-Heister, editor, Exensions of Logic Programming (LNCS 475), pages 253–281. Springer-Verlag, 1991.

    Google Scholar 

  12. Alberto Martelli and Ugo Montanari. An efficient unification algorithm. Transactions on Programming Languages and Systems, 4(2):258–282, April 1982.

    Article  Google Scholar 

  13. Tobias Nipkow. Equational reasoning in Isabelle. Science of Computer Programming, 12:123–149, 1989.

    MathSciNet  Google Scholar 

  14. Tobias Nipkow. Term rewriting and beyond — theorem proving in Isabelle. Formal Aspects of Computing, 1:320–338, 1989.

    Google Scholar 

  15. Tobias Nipkow. Functional unification of higher order patterns. In Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 64–74, Montreal, Canada, June 1993. IEEE Computer Society Press.

    Google Scholar 

  16. Lawrence Paulson. A higher order implementation of rewriting. Science of Computer Programming, 3:119–149, 1983.

    Google Scholar 

  17. Lawrence Paulson. Isabelle: The next 700 theorem provers. In P.G. Oddifreddi, editor, Logic and Computer Science, pages 361–386. Academic Press, 1990.

    Google Scholar 

  18. Gordon Plotkin. Building-in equational theories. Machine Intelligence, (7):73–90, 1972.

    Google Scholar 

  19. Gary Peterson and Mark Stickel. Complete sets of reductions for some equational theories. Journal of the Association for Computing Machinery, 28:233–264, 1981.

    Google Scholar 

  20. Konrad Slind. An implementation of higher order logic. Technical Report 91-419-03, University of Calgary Computer Science Department, 1991.

    Google Scholar 

  21. Mark Stickel. A unification algorithm for associative-commutative functions. Journal of the Association for Computing Machinery, 28(3):423–434, July 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstrasse 21, 80290, München, Germany

    Konrad Slind

Authors
  1. Konrad Slind
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jeffrey J. Joyce Carl-Johan H. Seger

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slind, K. (1994). AC unification in HOL90. In: Joyce, J.J., Seger, CJ.H. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1993. Lecture Notes in Computer Science, vol 780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57826-9_154

Download citation

  • DOI: https://doi.org/10.1007/3-540-57826-9_154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57826-0

  • Online ISBN: 978-3-540-48346-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation