Skip to main content
Springer Nature Link
Log in

Combination problems for commutative/monoidal theories or how algebra can help in equational unification

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We study the class of theories for which solving unification problems is equivalent to solving systems of linear equations over a semiring. It encompasses important examples like the theories of Abelian monoids, idempotent Abelian monoids, and Abelian groups. This class has been introduced by the authors independently of each other as “commutative theories” (Baader) and “monoidal theories” (Nutt).

We show that commutative theories and monoidal theories indeed define the same class (modulo a translation of the signature), and we prove that it is undecidable whether a given theory belongs to it. In the remainder of the paper we investigate combinations of commutative/monoidal theories with other theories. We show that finitary commutative/monoidal theories always satisfy the requirements for applying general methods developed for the combination of unification algorithms for disjoint equational theories.

Then we study the adjunction of monoids of homomorphisms to commutative/monoidal theories. This is a special case of a non-disjoint combination, which has an algebraic counterpart in the corresponding semiring. By studying equations over this semiring, we identify a large subclass of commutative/monoidal theories that are of unification type zero. We also show with methods from linear algebra that unitary and finitary commutative/monoidal theories do not change their unification type when they are augmented by a finite monoid of homomor-phisms, and how algorithms for the extended theory can be obtained from algorithms for the basic theory.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Baader, F.: Unification in Commutative Theories. J. Symb. Computation8, 479–497 (1989)

    Google Scholar 

  2. Baader, F.: Unification Properties of Commutative Theories: A Categorical Treatment. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poigné, A. (eds.) Proceedings of the Conference on Category Theory and Computer Science. Lecture Notes in Computer Science, Vol. 389. Berlin, Heidelberg, New York: Springer 1989

    Google Scholar 

  3. Baader, F.: Unification in Commutative Theories, Hubert's Basis Theorem, and Gröbner Bases. J. ACM40, 477–503 (1993)

    Google Scholar 

  4. Baader, F., Nutt, W.: Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification. In: Book, R. (ed.) Proceedings of the 4th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, Vol 488. Berlin, Heidelberg, New York: Springer 1991

    Google Scholar 

  5. Baader, F., Schulz, K. U.: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. In: Kapur, D. (ed.) Proceedings of the 11th International Conference on Automated Deduction. Lecture Notes in Computer Science, Vol. 607. Berlin, Heidelberg, New York: Springer 1992

    Google Scholar 

  6. Baader, F., Siekmann, J. H.: Unification Theory. In: Gabbay, D. M., Hogger, C. J., Robinson, J. A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford: Oxford University Press 1994

    Google Scholar 

  7. Bachmair, L.: Canonical Equational Proofs. Boston, Basel, Berlin: Birkhäuser 1991

    Google Scholar 

  8. Cohn, P. M.: Universal Algebra. New York: Harper and Row 1965

    Google Scholar 

  9. Comon, H., Haberstrau, M., Jouannaud, J.-P.: Decidable Problems in Shallow Equational Theories. In: Scedrov, A. (ed.) Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. Washington D.C.: IEEE Computer Society Press 1992

    Google Scholar 

  10. Davis, M.: Unsolvable Problems. In: Barwise, J. (ed.) Handbook of Mathematical Logic. Amsterdam: Elsevier Science Publishers 1977

    Google Scholar 

  11. Fay, M.: First-order Unification in an Equational Theory. In: Proceedings 4th Workshop on Automated Deduction 1979

  12. Fitting, M.: Basic Modal Logic. In: Gabbay, D. M., Hogger, C. J., Robinson, J. A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford: Oxford University Press 1993

    Google Scholar 

  13. Gallier, J., Raatz, S.: SLD-Resolution Methods for Horn Clauses with Equality Based onE-Unification. In: Keller, R. M. (ed.) Proceedings of the 3rd IEEE Symposium on Logic Programming. Washington D.C.: IEEE Computer Society Press 1986

    Google Scholar 

  14. Gallier, J., Snyder, S.: Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci.27, 203–260 (1989)

    Google Scholar 

  15. Grätzer, G.: Universal Algebra. Princeton: Van Nostrand 1968

    Google Scholar 

  16. Herrlich, H., Strecker, G. E.: Category Theory. Boston: Allyn and Bacon 1973

    Google Scholar 

  17. Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. J. ACM27, 797–821 (1980)

    Google Scholar 

  18. Jaffar, J., Lassez, J. L., Maher, M.: A Theory of Complete Logic Programs with Equality. J. Logic Programming1, 211–224 (1984)

    Google Scholar 

  19. Jouannaud, J. P., Kirchner, H.: Completion of a Set of Rules Modulo a Set of Equations. SIAM J. Comp.15, 1155–1194 (1986)

    Google Scholar 

  20. Kirchner, C., Klay, F.: Syntactic Theories and Unification. In: Mitchell, J. (ed.) Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science. Washington D.C.: IEEE Computer Society Press 1990

    Google Scholar 

  21. Lawvere, F. W.: Functional Semantics of Algebraic Theories. Ph.D. Thesis, Columbia University, New York (1963)

    Google Scholar 

  22. Lemmon, E. J.: Algebraic Semantics for Modal Logics I. J. Symbolic Logic31, 46–65 (1966)

    Google Scholar 

  23. Livesey, M., Siekmann, J.: Unification of Bags and Sets. SEKI-MEMO 76-II, Institut für Informatik I, Universität Karlsruhe (1976)

  24. Nevins, A. J.: A Human Oriented Logic for Automated Theorem Proving. J. ACM21, 606–621 (1974)

    Google Scholar 

  25. Nutt, W.: Unification in Monoidal Theories, Presentation at the Second Workshop on Unification. Val d'Ajol, France, (1988)

    Google Scholar 

  26. Nutt, W., Réty, P., Smolka, G.: Basic Narrowing Revisited. J. Symb. Computation7, 295–317 (1989)

    Google Scholar 

  27. Nutt, W.: The Unification Hierarchy is Undecidable. J. Automated Reasoning7, 369–381 (1991)

    Google Scholar 

  28. Nutt, W.: Unification in Monoidal Theories. In: Stickel, M. (ed.) Proceedings 10th International Conference on Automated Deduction. Lecture Notes in Computer Science, Vol. 499. Berlin, Heidelberg, New York: Springer 1990

    Google Scholar 

  29. Nutt, W.: Unification in Monoidal Theories is Solving Linear Equations over Semirings. Technical Report RR-92-01, DFKI Saarbrücken (1992)

    Google Scholar 

  30. Peterson, G., Stickel, M.: Complete Sets of Reductions for Some Equational Theories. J. ACM28, 233–264 (1981)

    Google Scholar 

  31. Plotkin, G.: Building in Equational Theories. Machine Intelligence7, 73–90 (1972)

    Google Scholar 

  32. Rotman, J. J.: The Theory of Groups. Boston: Allyn and Bacon 1973

    Google Scholar 

  33. Schmidt-Schauß, M.: Combination of Unification Algorithms. J. Symbolic Computation8, 51–99 (1989)

    Google Scholar 

  34. Slagle, J. R.: Automated Theorem Proving for Theories with Simplifiers, Commutativity and Associativity. J. ACM21, 622–642 (1974)

    Google Scholar 

  35. Stickel, M.: Automated Deduction by Theory Resolution. J. Automated Reasoning1, 333–355 (1985)

    Google Scholar 

  36. Taylor, W.: Equational Logic. Houston J. Math.5, 1–51 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehr- und Forschungsgebiet Theoretische Informatik, RWTH Aachen, Ahornstraße 55, D-52074, Aachen, Germany

    Franz Baader

  2. German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123, Saarbrücken, Germany

    Werner Nutt

Authors
  1. Franz Baader
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Werner Nutt
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baader, F., Nutt, W. Combination problems for commutative/monoidal theories or how algebra can help in equational unification. AAECC 7, 309–337 (1996). https://doi.org/10.1007/BF01195536

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords