Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1986: 8th International Conference on Automated Deduction pp 506–513Cite as

Unification in boolean rings

  • Unification Theory
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

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.

References

  1. F. Fages: “Associative-Commutative Unification”, Proc. 7th Int. Conf. on Automated Deduction, 1984, LNCS 170

    Google Scholar 

  2. J. Hsiang: “Refutational Theorem Proving using Term-Rewriting Systems”, Artificial Intelligence 25, 1985

    Google Scholar 

  3. 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. M. Livesey, J. Siekmann: “Unification of Sets and Multisets”, Memo Seki-76-II, Univ. Karlsruhe, 1976

    Google Scholar 

  5. J. H. Siekmann: “Universal Unification”, Proc. 7th Int. Conf. on Automated Deduction, 1984, LNCS 170

    Google Scholar 

  6. M. Stone: “The Theory of Representations for Boolean Algebra”, Trans. AMS 40, 1936

    Google Scholar 

  7. M.E. Stickel: “A Complete Unification Algorithm for Associative-Commutative Functions”, JACM 28, No 3, 1981

    Google Scholar 

  8. D.E. Watts, J.K. Cohen: “Computer-Implemented Set Theory”, Amer.Math.Month. 87, 1980

    Google Scholar 

  9. K. Yelick: “Combining Unification Algorithms for Confined Regular Equational Theories”, Proc. Rewriting Techniques and Applications, 1985, LNCS 202

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University, M13 9PL, Manchester

    Ursula Martin & Tobias Nipkow

Authors
  1. Ursula Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tobias Nipkow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, U., Nipkow, T. (1986). Unification in boolean rings. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_115

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_115

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation