Unification in boolean rings

  • Ursula Martin
  • Tobias Nipkow
Unification Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)

Abstract

A simple unification algorithm for terms containing variables, constants and the set operators intersection and symmetric difference is presented. The solution is straightforward because the algebraic structure under consideration is a boolean ring. The main part of the algorithm is finding a particular solution which is then substituted into a general formula to yield a single most general unifier. The combination with other equational theories is briefly considered but even for simple cases the extension seems non-trivial.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Fa 84]
    F. Fages: “Associative-Commutative Unification”, Proc. 7th Int. Conf. on Automated Deduction, 1984, LNCS 170Google Scholar
  2. [Hs 85]
    J. Hsiang: “Refutational Theorem Proving using Term-Rewriting Systems”, Artificial Intelligence 25, 1985Google Scholar
  3. [KRKaNa 85]
    A. Kandri-Rody, D. Kapur, P. Narendran: “An Ideal-theoretic Approach to Word Problems and Unification Problems over Finitely Presented Commutative Algebras”Google Scholar
  4. [LiSi 76]
    M. Livesey, J. Siekmann: “Unification of Sets and Multisets”, Memo Seki-76-II, Univ. Karlsruhe, 1976Google Scholar
  5. [Si 84]
    J. H. Siekmann: “Universal Unification”, Proc. 7th Int. Conf. on Automated Deduction, 1984, LNCS 170Google Scholar
  6. [St 36]
    M. Stone: “The Theory of Representations for Boolean Algebra”, Trans. AMS 40, 1936Google Scholar
  7. [St 81]
    M.E. Stickel: “A Complete Unification Algorithm for Associative-Commutative Functions”, JACM 28, No 3, 1981Google Scholar
  8. [WaCo 80]
    D.E. Watts, J.K. Cohen: “Computer-Implemented Set Theory”, Amer.Math.Month. 87, 1980Google Scholar
  9. [Ye 85]
    K. Yelick: “Combining Unification Algorithms for Confined Regular Equational Theories”, Proc. Rewriting Techniques and Applications, 1985, LNCS 202Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Ursula Martin
    • 1
  • Tobias Nipkow
    • 1
  1. 1.Department of Computer ScienceThe UniversityManchester

Personalised recommendations