Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1995: Computing and Combinatorics pp 101–110Cite as

Set-term unification in a logic database language

  • Session 2B: Database
  • Conference paper
  • First Online:

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

Abstract

Deterministic, parallel set-term unification algorithms for higher-order logic-based database languages, of which set terms have the commutative and idempotent properties, are lacking. As a result, an efficient, deterministic inference mechanism that can be used to determine answers to queries of these database languages is non-existent. To overcome these shortcomings, we propose a set-term unification approach for LDL/NR, a higher-order logic database language. Our approach not only computes all generalized ground unifiers of two given set terms in LDL/NR without duplicates, but also takes advantage of existing multiple processors for (potentially) computing all these unifiers in parallel.

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. A. Dovier, E. Omodeo, E. Pontelli, and G. Rossi, {log}: A logic programming language with finite sets. In Proceedings of 8th International Conference on Logic Programming, pages 111–124. The MIT Press, June 1991.

    Google Scholar 

  2. P. Lincoln and J. Christian. Adventures in Associative-Commutative Unification. In Proceedings of 9th International Conference on Automated Deduction, pages 359–367, 1988.

    Google Scholar 

  3. S. J. Lim. Set-Term Unification in a Logic Database language. Master's thesis, Brigham Young University, December 1994.

    Google Scholar 

  4. J. L. Mott, A. Kandel, and T. P. Baker. Discrete Mathematics for Computer Scientists and Mathematicians. Prentice-Hall, New Jersey, 1986.

    Google Scholar 

  5. J. H. Siekmann. Unification Theory. Journal of Symbolic Computation, 7:207–274, 1989.

    Google Scholar 

  6. F. Stolzenburg. An Algorithm for General Set Unificiation and its Complexity. In Proceedings of the Workshop on Logic Programming with Sets, June 1993.

    Google Scholar 

  7. O. Shmueli, S. Tsur, and C. Zaniolo. Compilation of Set Terms in the Logic Data Language (LDL). Journal of Logic Programming, 12(1):89–119, 1992.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Brigham Young University, 84602, Provo, UT, USA

    Seung Jin Lim & Yiu-Kai Ng

Authors
  1. Seung Jin Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yiu-Kai Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, S.J., Ng, YK. (1995). Set-term unification in a logic database language. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030824

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation