On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries
IEEE Transactions on Knowledge and Data Engineering
Query Optimization of Disjunctive Databases with Constraints through Binding Propagation
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Binding Propagation in Disjunctive Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On the rewriting and efficient computation of bound disjunctive datalog queries
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Generalization of ZYT-linearizability for bilinear datalog programs
Information and Computation
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
Precise complexity analysis for efficient datalog queries
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
| Hi-index | 0.00 |