Skip to main content
SpringerLink
Log in

Unification in finite algebras is unitary(?)

  • Conference paper
  • First Online:
9th International Conference on Automated Deduction (CADE 1988)

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

Included in the following conference series:

Abstract

Unification in algebras is widely seen as a means of improving the expressiveness and efficiency of resolution based deduction. In particular, finite algebras have recently gained considerable attention. Unification in the sense of Plotkin is based upon the notion of a set of most general unifiers, which however might either not exist or — at the other extreme — be too large. As a remedy to these conceptual drawbacks we suggest a redefinition of unification, such that with respect to this view unification in finite algebras becomes unitary. Previous work on unification in Postalgebras provides a universal unification algorithm. We will add a more application oriented approach. Applications of our methods to the switch level design of digital circuits are indicated.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. Baader F., Unification in Idempotent Semigroups is of Type Zero, JAR2, 1986

    Google Scholar 

  2. Balbes R. and Dwinger P., Distributive Lattices, University of Missouri Press, Columbia, U.S.A., 1974

    Google Scholar 

  3. Bryant R. Graph-Based Algorithms for Boolean Functions Manipulations, IEEE Transactions on Computers, Vol. C-35, No. 8, pg. 677–691, 1986

    Google Scholar 

  4. Büttner W. and Simonis H., Embedding Boolean Expressions into Logic Programming, Journal of Symbolic Computation (to appear 1987)

    Google Scholar 

  5. Büttner W. Application Driven Prolog Extensions, Submitted to International Symposium on Multiple-Valued Logic, Palma de Mallorca, Spain, May 1988

    Google Scholar 

  6. Nipkow T., Unification in Functionally Complete Algebras, Unpublished Manuscript 1987, Dept. CS, University of Manchester, England

    Google Scholar 

  7. Plotkin G., Building in Equational Theories, Machine Intelligence 7, pg. 73–90, 1972

    Google Scholar 

  8. Siekmann J., Unification Theory, Proceedings, European Conference on Artificiallntelligence, Brighton, England, July 1986

    Google Scholar 

  9. Rosenberg I. and Schweigert D., Compatible Ordesings and Tolerances of Lattices, Preprint No. 70, Dept. of Mathematics, University of Kaiserslautern, West Germany, 1984

    Google Scholar 

  10. Simonis H., Using Extended Prolog to Model Digital Circuits, Technical Report TR-LP-2202 E.C.R.C.(European Computer Industry Research Centre), 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siemens AG Corporate Laboratories for Information Technology, Otto-Hahn-Ring 6, D-8000, München 83, West Germany

    Wolfram Büttner

Authors
  1. Wolfram Büttner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Büttner, W. (1988). Unification in finite algebras is unitary(?). In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012844

Download citation

  • DOI: https://doi.org/10.1007/BFb0012844

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation