Advertisement

Unification in monoidal theories

  • Werner Nutt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 449)

Abstract

We study the unification problem for a class of equational theories that comprises important examples like abelian monoids (AC), idempotent abelian monoids (ACI), and abelian groups. Monoidal theories have the common characteristic that unification algorithms are based on solving linear equation systems over a semiring.

The close correspondence between unification and linear algebra can be used to characterize the unification type of monoidal theories in purely algebraic terms, and an application of Hilbert's Basis Theorem gives a sufficient criterion for a monoidal theory to be unitary.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ba86]
    F. Baader, “The Theory of Idempotent Semigroups is of Unification Type Zero”, J. Automated Reasoning 2, 1986.Google Scholar
  2. [Ba89a]
    F. Baader, “Unification in Commutative Theories”, in C. Kirchner (ed.), Special Issue on Unification, J. Symbolic Computation, 1989.Google Scholar
  3. [Ba89b]
    F. Baader, “Unification in Commutative Theories, Hilbert's Basis Theorem, and Gröbner Bases”, preprint, 1989Google Scholar
  4. [BB86]
    F. Baader, W. Büttner, “Unification in Commutative Idempotent Monoids”, preprint, 1986, to appear in TCS.Google Scholar
  5. [BH89]
    H.-J. Bürckert, A. Herold, M. Schmidt-Schauß, “On Equational Theories, Unification, and Decidability”, in C. Kirchner (ed.), Special Issue on Unification, J. Symbolic Computation, 1989.Google Scholar
  6. [Bü86]
    W. Büttner, “Unification in the Data Structure Multiset”. J. Automated Reasoning 2, 1986.Google Scholar
  7. [FH86]
    F. Fages, G. Huet, “Complete Sets of Unifiers and Matchers in Equational Theories”, TCS 43 (2,3), 1986.Google Scholar
  8. [Fo85]
    A. Fortenbacher, “An Algebraic Approach to Unification under Associativity and Commutativity”, LNCS 202, 1985.Google Scholar
  9. [Go89]
    J. Goguen, “What Is Unification?”, in H. Aït-Kaci, M. Nivat (eds.), Resolution of Equations in Algebraic Structures, Academic Press, 1989.Google Scholar
  10. [Ja80]
    N. Jacobson, Basic Algebra II, Freeman, San Francisco 1980.Google Scholar
  11. [Ki89]
    C. Kirchner (ed.), Special Issue on Unification, J. Symbolic Computation, 1989.Google Scholar
  12. [Kn68]
    D. E. Knuth, The Art of Computer Programming, Vol.1, Addison Wesley, 1968.Google Scholar
  13. [La84]
    D. Lankford, G. Butler, B. Brady, “Abelian Group Unification Algorithms for Elementary Terms”, Contemporary Mathematics 29, 1984.Google Scholar
  14. [LS78]
    M. Livesey, J. H. Siekmann, “Unification of Sets and Multisets”, SEKI-Report, Universität Karlsruhe 1978.Google Scholar
  15. [Nu90]
    W. Nutt, “Unification in Monoidal Theories”, SEKI-Report, Universität Kaiserslautern 1990. Also presented at 2nd International Workshop on Unification, Val d'Ajol, France, 1988.Google Scholar
  16. [RB85]
    D. E. Rydeheard, R. M. Burstall, “A Categorical Unification Algorithm”, LNCS 240, 1985.Google Scholar
  17. [Sc86]
    M. Schmidt-Schauß, “Unification under Associativity and Idempotence is of Type Nullary”, J. Automated Reasoning 2, 1986.Google Scholar
  18. [Si89]
    J. H. Siekmann, “Unification Theory: A Survey”, in C. Kirchner (ed.), Special Issue on Unification, Journal of Symbolic Computation, 1989.Google Scholar
  19. [St81]
    M. E. Stickel, “A Unification Algorithm for Associative-Commutative Functions”, J. ACM 28, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Werner Nutt
    • 1
  1. 1.DFKIKaiserslauternWest Germany

Personalised recommendations