Detecting AND-parallelism in logic programs without literal ordering

The authors present an AND-parallelism detection scheme which does not order literals or analyze data dependency. The simple concept of variable holding allows the system to utilize AND-parallel literals concurrently without causing binding conflicts. The run-time support of this scheme is minimal: groundness test, independence test, and variable holding. Without extra runtime processing, this scheme also supports an option mode declaration, which provides its programmers with greater flexibility to specify parallel execution. The execution graphs generated by this scheme are compared with the graphs generated by other models. The authors find that this scheme generally uses the highest degree of parallelism.<>