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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
