Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1989: Rewriting Techniques and Applications pp 2–14Cite as

Characterizations of unification type zero

  • Regular Papers
  • Conference paper
  • First Online:

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

Abstract

In the literature several methods have hitherto been used to show that an equational theory has unification type zero. These methods depend on conditions which are candidates for alternative characterizations of unification type zero. In this paper we consider the logical connection between these conditions on the abstract level of partially ordered sets. Not all of them are really equivalent to type zero.

The conditions may be regarded as tools which can be used to determine the unification type of given theories. They are also helpful in understanding what makes a theory to be of type zero.

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.

6. References

  • Baader, F. (1986). The Theory of Idempotent Semigroups is of Unification Type Zero. J. Automated Reasoning 2.

    Google Scholar 

  • Baader, F. (1987). Unification in Varieties of Idempotent Semigroups. Semigroup Forum 36.

    Google Scholar 

  • Baader, F. (1988). A Note on Unification Type Zero. Information Processing Letters 27.

    Google Scholar 

  • Bürckert, H.J. (1987). Matching — A Special Case of Unification? SEKI Technical Report, Universität Kaiserslautern.

    Google Scholar 

  • Bürckert, H.J., Herold, A., Schmidt-Schauß, M. (1987). On Equational Theories, Unification and Decidability. Proceedings of the RTA '87 Bordeaux (France). Springer Lec. Notes Comp. Sci. 256.

    Google Scholar 

  • Büttner, W. (1986). Unification in the Data Structure Multiset. J. Automated Reasoning 2.

    Google Scholar 

  • Fages, F., Huet, G. (1983). Complete Sets of Unifiers and Matchers in Equational Theories. Proceedings of the CAAP '83 Pisa (Italy). Springer Lec. Notes Comp. Sci. 159.

    Google Scholar 

  • Fages, F., Huet, G. (1986). Complete Sets of Unifiers and Matchers in Equational Theories. Theor. Comp. Sci. 43.

    Google Scholar 

  • Plotkin, G. (1972). Building in Equational Theories. Machine Intelligence 7.

    Google Scholar 

  • Schmidt-Schauß, M. (1986). Unification under Associativity and Idempotence is of Type Nullary. J. Automated Reasoning 2.

    Google Scholar 

  • Schmidt-Schauß, M. (1986a). Unifikation Properties of Idempotent Semigroups. SEKI Technical Report, Universität Kaiserslautern.

    Google Scholar 

  • Siekmann, J. (1988). Unification Theory. To appear in J. Symbolic Computation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMMD 1, Universität Erlangen-Nürnberg, Martensstraße 3, D-8520, Erlangen, West Germany

    Franz Baader

Authors
  1. Franz Baader
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baader, F. (1989). Characterizations of unification type zero. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-51081-8_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46149-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation