Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1991: Mathematical Foundations of Computer Science 1991 pp 84–92Cite as

Unification in incompletely specified theories: A case study

  • Contributions
  • Conference paper
  • First Online:

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

Abstract

Let T be an equational theory and let P be a unification procedure. In order to initiate P to do unification in T, T must in some way be presented to P. Due to practical considerations, P can sometimes only obtain approximations of T; each approximation specifies a class of theories in which T is just a single member. In this paper it is suggested to use approximation frames to formally characterize these classes. As a consequence, each approximation frame also specifies which complete sets of T-unifiers that are strongly complete. Those are the only complete sets of T-unifiers that can be found within the scope of accessing only available approximations of T. A unification procedure which finds such sets whenever they exist is said to be weakly complete. These concepts are specialized to the study of so called evaluation based unification algorithms. An approximation frame characterizing the inherent incompleteness of such algorithms is given. Finally a weakly complete evaluation based algorithm is developed.

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. H. Ait-Kaci, P. Lincoln, and R. Nasr. Le Fun: Logic, Equations and Functions. In Symp. on Logic Programming, pages 17–23, 1987.

    Google Scholar 

  2. M. Bellia and G. Levi. The Relation between Logic and Functional Languages. J. Logic Programming, (3):217–236, 1986.

    Google Scholar 

  3. S. Bonnier. Horn Clause Logic with External Procedures: Towards a Theoretical Framework. Licentiate thesis 197, Dep. of Computer and Information Science, Linköping University, Linköping, Sweden, 1989.

    Google Scholar 

  4. S. Bonnier. Type-driven Evaluation for Integrating FP and LP. Presented at the Integration workshop at Schloß Dagstuhl, March 1991. Draft.

    Google Scholar 

  5. S. Bonnier and J. Maluszynski. Towards a Clean Amalgamation of Logic Programs with External Procedures. In 5:th Int. Conf. and Symp. on Logic Programming, pages 311–326. MIT Press, 1988.

    Google Scholar 

  6. D. DeGroot and G. Lindstrom, editors. Logic Programming, Functions, Relations and Equations. Prentice-Hall, 1986.

    Google Scholar 

  7. M. Dincbas and P. van Hentenryck. Extended Unification Algorithms for the Integration of Functional Programming into Logic Programming. J. Logic Programming, (4):199–227, 1987.

    Google Scholar 

  8. M.J. Fay. First-Order Unification in an Equational Theory. Master Thesis 78-5-002, University of California at Santa Cruz, 1978.

    Google Scholar 

  9. U. Furbach and S. Hölldobler. Modelling the Combination of Functional and Logic Programming Languages. J. Symbolic Computation, (2):123–138, 1986.

    Google Scholar 

  10. J. Goguen and J. Meseguer. EQLOG: Equality, Types and Generic Modules for Logic Programming. In D. DeGroot and G. Lindstrom, editors, Logic Programming, Functions, Relations and Equations, pages 295–363. Prentice-Hall, 1986.

    Google Scholar 

  11. G. Huet and D.C. Oppen. Equations and Rewrite Rules a Survey. In R.V. Book, editor, Formal Language Theory, Perspectives and Open Problems, pages 349–405. Academic Press, 1980.

    Google Scholar 

  12. J.M. Hullot. Canonical Forms and Unification. In CADE-5, pages 318–334, 1980.

    Google Scholar 

  13. J. Leszczylowski, S. Bonnier, and J. Maluszynski. Logic Programming with External Procedures: Introducing S-Unification. Information Processing Letters, (27):159–165, 1988.

    Google Scholar 

  14. D.W. Shin, J.H. Nang, S. Han, and S.R. Maeng. A Functional Logic Language based on Canonical Unification. In Symp. on Logic Programming, pages 328–333, 1987.

    Google Scholar 

  15. J.H. Siekmann. Universal Unification. In CADE-7, pages 1–42, 1984.

    Google Scholar 

  16. J.R. Slagle. Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. J. ACM, 21(4):622–642, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Linköping University, S-581 83, Linköping, Sweden

    Staffan Bonnier

Authors
  1. Staffan Bonnier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonnier, S. (1991). Unification in incompletely specified theories: A case study. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation