Skip to main content
SpringerLink
Log in

Design and analysis of parallel set-term unification

  • Session 10: Rewriting and Logic
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

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

Included in the following conference series:

  • 94 Accesses

Abstract

Deterministic, parallel set-term unification algorithms, of which set terms have the commutative and idempotent properties, are lacking. In this paper, we propose a deterministic, parallel set-term unification algorithm which not only computes all generalized ground unifiers of a given pair of set terms without duplicates, but also takes advantages of existing multiprocessor computer systems for computing all these unifiers in parallel. Cost analysis of the proposed algorithm is included.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. de Kergommeaux and P. Codognet. Parallel Logic Programming Systems. ACM Computing Surveys, 26(3):295–336, September 1994.

    Google Scholar 

  2. 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 

  3. S. Ganguly, W. Hasan, and R. Krishnamurthy. Query Optimization for Parallel Execution. In Proceedings of the SIGMOD Conference, pages 9–18. ACM, 1992.

    Google Scholar 

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

    Google Scholar 

  5. P. Valduriez. Parallel Database Systems: the Case for Shared-something. In Proceedings of the 9th Intl. Conf. on Data Engineering, pages 460–465, April 1993.

    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

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, SJ., Ng, YK. (1997). Design and analysis of parallel set-term unification. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045099

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation