A new method for describing the AND-OR-parallel execution of logic programs

Abstract

A new method for describing the execution of logic programs is presented in this paper. Our method, named OR-forest, not only retains the merits of the traditional OR-tree description in achieving high independence of each computation unit, but also overcomes the two major drawbacks of the traditional OR-tree description: the lack of the ability for describing AND-parallel execution and the redundancies in describing OR-parallel execution, It provides a new framework for developing execution models which could efficiently exploit both AND—and OR-parallelisms in logic programs.