A control strategy based on heuristic techniques for the parallel execution of logic programs

We apply parallel heuristic solving techniques to the exponentially complex problem of interpretation of pure logic programs. Parallel heuristics incorporated within the control strategy employed to solve logic programs are used to guide the search for a solution in parts of the search space most likely to yield a solution. The results show that our strategy when applied to standard benchmarks not only improves the time taken to arrive at a solution by more than a linear factor, but reduces the memory requirements as well