Apr 27, 2012 · Abstract:In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified ...
Magic Sets for disjunctive Datalog programs - ScienceDirect.com
www.sciencedirect.com › article › pii
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented.
Apr 27, 2012 · In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation ...
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented.
Magic sets are a Datalog to Datalog rewriting technique to optimize query answering. The rewritten program focuses on a portion of the stable model(s) of the ...
The experimental results confirm the usefulness of Magic-Sets for disjunctive datalog, and they highlight the computational gain obtained by our method, which ...
In this paper we present an implementa- tion of the Magic Set rewriting technique that is applicable to positive disjunctive logic programs with function ...
Magic-Set-transformed disjunctive programs frequently contain redundant rules. We tackle this problem and propose a method for preventing the generation of such ...
Aug 28, 2021 · In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation ...
Dynamic Magic Sets are an extension of the technique that takes into account the nondeterministic knowledge encoded into Disjunctive Datalog programs.