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
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Logical query optimization by proof-tree transformation
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
ACM Transactions on Database Systems (TODS)
Optimization of disjunctive queries
Proceedings of the 1999 international conference on Logic programming
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Semantics of Disjunctive Deductive Databases
ICDT '92 Proceedings of the 4th International Conference on Database Theory
The PushDown Method to Optimize Chain Logic Programs (Extended Abstract)
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Minimal Founded Semantics for Disjunctive Logic Programming
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
| Hi-index | 0.00 |
In this paper we present a technique for the optimization of bound queries over disjunctive deductive databases with constraints, i.e. rules defining properties which have to be satisfied by all instances over database schema. The technique we propose, allows the binding propagation into disjunctive queries with a set of constraints; thus, reducing the size of the data relevant to answer the query it, consequently, minimizes both the complexity of computing a single model and the whole number of models to be considered. The main contribution of this work consists in the extension of previous techniques by considering Datalog programs with both disjunctive heads and constraints. In particular, by considering weak constraints the technique is also suitable for dealing with optimization problems. Several experiments have confirmed the value of the technique.