Abstract
We present results concerning the computational complexity of the key execution mechanisms required to handle Dependent And-Parallel executions in logic programming. We develop formal abstractions of the problems in terms of dynamic trees, design efficient data structures, and present some lower bound results. This work is part of a larger effort to understand, formalize, and study the complexity-theoretic and algorithmic issues in parallel implementations of logic programming.
Research partially supported by NSF grants EIA-0220590, EIA-0130887, CCR-9875279, CCR-9820852, CCR-9900320
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alstrup, S., et al.: Marked Ancestor Problems. In: FOCS, pp. 534–544 (1998)
Ben-Amram, A.M., Galil, Z.: On Pointers versus Addresses. JACM 39(3) (1992)
Blum, N.: On the single-operation worst-case time complexity of the disjoint set union problem. SIAM Journal on Computing 15(4), 1021–1024 (1986)
Cole, R., Hariharan, R.: Dynamic LCA Queries on Trees. In: SODA. ACM, New York (1999)
Dal Palù, A., et al.: An Optimal Algorithm for NCA on PPMs. In: SWAT (2002)
Drakos, N.: Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking. In: IJCAI, pp. 157–162. Morgan Kaufmann, San Francisco (1989)
Gabow, H.N., Tarjan, R.E.: A Linear-time Algorithm for a Special Case of Disjoint Set Union. Journal of Computer and System Sciences 30, 209–221 (1985)
Gupta, G., et al.: Parallel Execution of Prolog Programs. TOPLAS 23(4) (2001)
Pontelli, E., et al.: Implementation Mechanisms for DAP. In: ICLP. MIT Press, Cambridge (1997)
Pontelli, E., et al.: An Optimal Data Structure to Handle Dynamic Environments in Non-Deterministic Computations. Computer Languages 28(2) (2002)
Pontelli, E., Ranjan, D., Gupta, G.: On the Complexity of Parallel Implementation of Logic Programs. In: FSTTCS, pp. 123–137. Springer, Heidelberg (1997)
Ranjan, D., et al.: The Temporal Precedence Problem. Algorithmica 28 (2000)
Shen, K.: Exploiting Dependent And-parallelism in Prolog. In: JICSLP. MIT, Cambridge (1992)
Tarjan, R.E.: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. Journal of Computer and System Sciences 2(18), 110–127 (1979)
Tebra, H.: Optimistic And-Parallelism in Prolog. In: PARLE. Springer, Heidelberg (1987)
Tsakalidis, A.: Maintaining Order in a Generalized Linked List. ACTA Informatica 21, 101–112 (1984)
van Emde Boas, P., et al.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory 10 (1977)
Villaverde, K., et al.: A Methodology for Order-sensitive Execution of Nondeterministic Languages on Beowulf Platforms. In: Euro-Par. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Y., Pontelli, E., Ranjan, D. (2003). On the Complexity of Dependent And-Parallelism in Logic Programming. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24599-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20642-2
Online ISBN: 978-3-540-24599-5
eBook Packages: Springer Book Archive