Dynamic magic sets for programs with monotone recursive aggregates

DOI10.1007/978-3-642-20895-9_14MaRDI QIDQ3003251zbMATH OpenOpenAlexWikidataFDO

Authors M. Alviano, Gianluigi Greco, N. Leone

Publication date 26 May 2011

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20895-9_14

zbMATH Keywords

disjunctive logic programmingmagic setsrecursive aggregates

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logic Programming
• Magic sets for disjunctive Datalog programs
• Dynamic magic sets for disjunctive Datalog programs
• An analysis of magic sets and related optimization strategies for logic queries
• Rewriting recursive aggregates in answer set programming: back to monotonicity

Cited in

(7)

• Magic sets for disjunctive Datalog programs
• Pushing extrema aggregates to optimize logic queries
• Design and implementation of aggregate functions in the DLV system
• Shared aggregate sets in answer set programming
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Enhancing magic sets with an application to ontological reasoning
• Bounded satisfiability checking of \(\mathrm{FOL}^*\) formulas with aggregations

This page was built for publication: Dynamic magic sets for programs with monotone recursive aggregates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003251)