Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Design overview of the NAIL] system
Proceedings on Third international conference on logic programming
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The complexity of ordering subgoals
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Logical Approach to Capability-Based Rewriting in a Mediator for WebSources
Journal of Intelligent Information Systems
Partial results for online query processing
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
State-saving transformations for efficient bottom-up
Annals of Mathematics and Artificial Intelligence
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
Hyperlog: A Graph-Based System for Database Browsing, Querying, and Update
IEEE Transactions on Knowledge and Data Engineering
Optimizing Large Join Queries in Mediation Systems
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Computing complete answers to queries in the presence of limited access patterns
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing Recursive Information Gathering Plans in EMERAC
Journal of Intelligent Information Systems
Efficiently ordering subgoals with access constraints
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adding magic to an optimising datalog compiler
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The divide-and-conquer subgoal-ordering algorithm for speeding up logic inference
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
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