Enhancing magic sets with an application to ontological reasoning

07/19/2019
by   Mario Alviano, et al.
0

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 input program which is sufficient to answer the given query. However, the rewriting may introduce new recursive definitions, which can involve even negation and aggregations, and may slow down program evaluation. This paper enhances the magic set technique by preventing the creation of (new) recursive definitions in the rewritten program. It turns out that the new version of magic sets is closed for Datalog programs with stratified negation and aggregations, which is very convenient to obtain efficient computation of the stable model of the rewritten program. Moreover, the rewritten program is further optimized by the elimination of subsumed rules and by the efficient handling of the cases where binding propagation is lost. The research was stimulated by a challenge on the exploitation of Datalog/dlv for efficient reasoning on large ontologies. All proposed techniques have been hence implemented in the dlv system, and tested for ontological reasoning, confirming their effectiveness. Under consideration for publication in Theory and Practice of Logic Programming.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2018

Cautious reasoning in ASP via minimal models and unsatisfiable cores

Answer Set Programming (ASP) is a logic-based knowledge representation f...
research
05/31/2018

Technical Report: Inconsistency in Answer Set Programs and Extensions

Answer Set Programming (ASP) is a well-known problem solving approach ba...
research
04/11/2014

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning

We study the problem of rewriting a disjunctive datalog program into pla...
research
04/23/2018

Top-down and Bottom-up Evaluation Procedurally Integrated

This paper describes how XSB combines top-down and bottom-up computation...
research
05/11/2023

Enhancing Datalog Reasoning with Hypertree Decompositions

Datalog reasoning based on the seminaïve evaluation strategy evaluates r...
research
04/23/2018

Shared aggregate sets in answer set programming

Aggregates are among the most frequently used linguistic extensions of a...
research
04/27/2012

Magic Sets for Disjunctive Datalog Programs

In this paper, a new technique for the optimization of (partially) bound...

Please sign up or login with your details

Forgot password? Click here to reset