Design and analysis of parallel set-term unification
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.
Unable to display preview. Download preview PDF.
- 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