Dynamic Magic Sets for Disjunctive Datalog Programs

Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negation in bodies. Magic Sets are a technique for optimizing query answering over logic programs and have been originally defined for standard Datalog, that is, ASP without disjunction and negation. Essentially, the input program is rewritten in order to identify a subset of the program instantiation which is sufficient for answering the query. Dynamic Magic Sets (DMS) are an extension of this technique to ASP. The optimization provided by DMS can be exploited also during the nondeterministic phase of ASP systems. In particular, after some assumptions have been made during the computation, parts of the program may become irrelevant to a query (because of these assumptions). This allows for dynamic pruning of the search space, which may result in exponential performance gains. DMS has been implemented in the DLV s...

• Type: Conference
• Year: 2010
• Where: ICLP
• Authors: Mario Alviano
• Keywords: Answer Set Programming, Automated Reasoning, Common Sense Reasoning, ICLP 2010, Magic Sets