An algorithm for ordering subgoals in NAIL?
暂无分享,去创建一个
Rule-goal graphs are the central data structures used in the NAIL′ system, a knowledge-base system being developed at Stanford University They are constructed while testing the applicability of capture rules, and traversed while generating ICODE to evaluate queries. Generating rule-goal graphs may be reduced to the problem of ordering subgoals. This paper gives an algorithm for generating rule-goal graphs efficiently, in time polynomial in the size of the rules if the arity of recursive predicates is bounded. The graphs generated may be suboptimal for some purposes, but the algorithm will always find a rule-goal graph if one exists. The algorithm has been implemented in Cprolog, and is currently being used to generate rule-goal graphs for the NAIL′ system
[1] Jeffrey D. Ullman,et al. The complexity of ordering subgoals , 1988, PODS.
[2] David Maier,et al. Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.
[3] Jeffrey D. Ullman,et al. Design Overview of the NAIL! System , 1986, ICLP.
[4] Jeffrey D. Ullman,et al. Implementation of logical query languages for databases , 1985, TODS.