论文部分内容阅读
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 highindependence 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 indescribing OR-parallel execution,It provides a new framework for developing execution models which couldefficiently exploit both AND-and OR-parallelisms in logic in programs.
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 indescribing OR-parallel execution, It provides a new framework for developing execution models which couldefficiently exploit both AND-and OR-parallelisms in logic in programs.