Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1992: Automated Deduction—CADE-11 pp 193–207Cite as

Unification in order-sorted algebras with overloading

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

Abstract

We present an algorithm for unification in the combination of a theory Th 1 and one of its overloaded extensions Th 2 in the order-sorted framework. This problem is a particular combination problem where the signatures are not disjoint. A major consequence is that an equality proof between two pure terms in Th 1 may need the use of an axiom of Th 2. This makes the usual combination techniques incomplete, in particular the solving of pure equations in the theory to which they belong. To solve the problem, we need a separated normal form as well as a complete set of normalizing substitutions.

This research was supported in part by GRECO Programmation CNRS and ESPRIT Working Group COMPASS.

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. Alexandre Boudet. Unification in combination of equational theories: an efficient algorithm. In Proc. 10th Conf. on Automated Deduction, Kaiserslautern, LNCS 449. Springer-Verlag, July 1990.

    Google Scholar 

  2. Alexandre Boudet, Evelyne Contejean, and Hervé Devie. A new AC-unification algorithm with a new algorithm for solving diophantine equations. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.

    Google Scholar 

  3. Hubert Comon. Inductive proofs by specifications transformation. In Proc. 3rd Rewriting Techniques and Applications 89, Chapel Hill, LNCS 355, pages 76–91. Springer-Verlag, April 1989.

    Google Scholar 

  4. Hubert Comon. Equational formulas in order-sorted algebras. In Proc. ICALP, Warwick. Springer-Verlag, July 1990.

    Google Scholar 

  5. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–309. North-Holland, 1990.

    Google Scholar 

  6. François Fages. Associative-commutative unification. J. Symbolic Computation, 3(3), June 1987.

    Google Scholar 

  7. A. Frisch. A general framework for sorted deduction: Fundamental results for hybrid reasoning. In Conf. on Principles of Knowledge Representation and Reasoning. Morgan Kaufmann, 1989.

    Google Scholar 

  8. K. Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. 12th ACM Symp. Principles of Programming Languages, New Orleans, 1985.

    Google Scholar 

  9. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.

    Google Scholar 

  10. Claude Kirchner. Méthodes et Outils de Conception Systématique d'Algorithmes d'Unification dans les Théories equationnelles. Thèse d'Etat, Univ. Nancy, France, 1985.

    Google Scholar 

  11. Claude Kirchner. Order-sorted equational unification. In Proc. 5th Int. Conference on Logic Programming, Seattle, August 1988.

    Google Scholar 

  12. Claude Kirchner, Hélène Kirchner, and José Meseguer. Operational semantics of OBJ-3. In Proc. 15th ICALP, Tampere, LNCS 317. Springer-Verlag, July 1988.

    Google Scholar 

  13. A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258–282, 1982.

    Google Scholar 

  14. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.

    Google Scholar 

  15. M. Schmidt-Schauss. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation, 1990. Special issue on Unification.

    Google Scholar 

  16. G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-Sorted Equational Computation. In Hassan Aït-Kaci and Maurice Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2, Rewriting Techniques, chapter 10, pages 297–367. Academic Press, New York, N.Y., 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre d'Orsay, LRI, CNRS URA 410, Université Paris-Sud, 91405, Orsay Cedex

    Alexandre Boudet

Authors
  1. Alexandre Boudet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudet, A. (1992). Unification in order-sorted algebras with overloading. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_165

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_165

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55602-2

  • Online ISBN: 978-3-540-47252-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation