The OR-forest description for the execution of logic programs

Abstract

This paper presents a new method for desoribing the execution of logic programs — the OR-forest description.The OR-forest description can explicitly describe both AND- and OR-parallel execution of logic programs and avoid a class of redundancies in describing OR-parallel execution, overcoming the two major drawbacks of the traditional OR-tree discription.