Computer Science – Artificial Intelligence
Scientific paper
2011-05-27
Journal Of Artificial Intelligence Research, Volume 9, pages 37-97, 1998
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.509
It is common to view programs as a combination of logic and control: the logic part defines what the program must do, the control part -- how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered the issue of automatic generation of control for improving the efficiency of logic programs. In this paper we present a novel algorithm for automatic finding of lowest-cost subgoal orderings. The algorithm works using the divide-and-conquer strategy. The given set of subgoals is partitioned into smaller sets, based on co-occurrence of free variables. The subsets are ordered recursively and merged, yielding a provably optimal order. We experimentally demonstrate the utility of the algorithm by testing it in several domains, and discuss the possibilities of its cooperation with other existing methods.
Ledeniov O.
Markovitch S.
No associations
LandOfFree
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-664314