An algorithm for ordering subgoals in NAIL?
- 1 March 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
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′ systemKeywords
This publication has 3 references indexed in Scilit:
- The complexity of ordering subgoalsPublished by Association for Computing Machinery (ACM) ,1988
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985