On the Complexity of Dependent And-Parallelism in Logic Programming

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.

[1]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.

[2]  Desh Ranjan,et al.  An optimal data structure to handle dynamic environments in non-deterministic computations , 2002, Comput. Lang. Syst. Struct..

[3]  Mats Carlsson,et al.  Parallel execution of prolog programs: a survey , 2001, TOPL.

[4]  Norbert Blum,et al.  On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem , 1986, SIAM J. Comput..

[5]  Stephen Alstrup,et al.  Marked ancestor problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[6]  Zvi Galil,et al.  On pointers versus addresses , 1992, JACM.

[7]  Richard Cole,et al.  Dynamic LCA queries on trees , 1999, SODA '99.

[8]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[9]  Robert E. Tarjan,et al.  A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..

[10]  Desh Ranjan,et al.  The Temporal Precedence Problem , 2000, Algorithmica.

[11]  Desh Ranjan,et al.  On the Complexity of Parallel Implementation of Logic Programs , 1997, FSTTCS.

[12]  Nikos Drakos.  Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking , 1989, IJCAI.

[13]  Karen Villaverde,et al.  A Methodology for Order-Sensitive Execution of Non-deterministic Languages on Beowulf Platforms , 2003, Euro-Par.

[14]  Athanasios K. Tsakalidis.  Maintaining order in a generalized linked list , 2004, Acta Informatica.

[15]  Hans Tebra.  Optimistic And-Parallelism in Prolog , 1987, PARLE.