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
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The Alexander method-a technique for the processing of recursive axioms in deductive databases
New Generation Computing
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Efficient bottom-up computation of queries on stratified databases
Journal of Logic Programming
Magic-sets transformation in nonrecursive systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The alternating fixpoint of logic programs with negation
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bottom-up evaluation and query optimization of well-founded models
Theoretical Computer Science
Argument reduction by factoring
Theoretical Computer Science
Optimizing existential queries in stratifiable deductive databases
Proceedings of the 2005 ACM symposium on Applied computing
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Magic Sets and their application to data integration
Journal of Computer and System Sciences
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A magic approach to optimizing incremental relational expressions
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
A transformation-based approach to view updating in stratifiable deductive databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
Efficient integrity checking for databases with recursive views
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
| Hi-index | 0.00 |
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstratifiable rules, we propose to use Kerisit's weak consequence operator to compute the well-founded model of magic rules (guaranteed to be two-valued). We show that its application in combination with the concept weak stratification, however, may lead to a set of answers which is neither sound nor complete with respect to the well-founded model. This problem is cured by introducing the new concept soft stratification instead.