On the Complexity of Dependent And-Parallelism in Logic Programming

Abstract We present results concerning the computational complexity of some 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 data structures for efficient solutions, 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 languages. These results have already impacted implementation of novel parallel logic programming systems