Enhancing Magic Sets with an Application to Ontological Reasoning. Issue 5 (September 2019)

• Record Type: Journal Article
• Authors: ALVIANO, MARIO; LEONE, NICOLA; VELTRI, PIERFRANCESCO; ZANGARI, JESSICA
• Is Part Of: Theory and practice of logic programming. Volume 19:Issue 5/6(2019)
• Page Start: 654
• Page End: 670
• Publication Date: 2019-09
• Subjects: Datalog, -- query answering, -- magic sets, -- nonmonotonic reasoning, -- aggregations.; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068419000115
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: 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.