Alternation and the computational complexity of logic programs
Journal of Logic Programming
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
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
Journal of the ACM (JACM)
On the complexity of dataflow analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for ordering subgoals in NAIL?
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
State-saving transformations for efficient bottom-up
Annals of Mathematics and Artificial Intelligence
Optimizing Large Join Queries in Mediation Systems
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Computing complete answers to queries in the presence of limited access patterns
The VLDB Journal — The International Journal on Very Large Data Bases
Processing first-order queries under limited access patterns
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficiently ordering subgoals with access constraints
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting queries using views with access patterns under integrity constraints
Theoretical Computer Science
The divide-and-conquer subgoal-ordering algorithm for speeding up logic inference
Journal of Artificial Intelligence Research
Rewriting queries using views with access patterns under integrity constraints
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
Selection of an appropriate order for the evaluation of subgoals in a logical rule frequently is essential for efficiency. We formulate the problem as one of feasible subgoal orders and show that the question is inherently exponential in time. The proof is by reduction from linear-space alternating Turing machine recognition, which appears to be far easier, in this case, than the more obvious reduction from exponential-time (ordinary) Turing machines