Dynamic magic sets and super-coherent answer set programs

MaRDI QIDQ3011297zbMATH OpenFDO

Authors M. Alviano, Wolfgang Faber

Publication date 28 June 2011

Full work available at URL https://arxiv.org/abs/1011.4377, http://iospress.metapress.com/content/nu45264042432842/fulltext.html

zbMATH Keywords

magic setsgeneral answer set programmingquery answering optimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Recommendations

• Dynamic magic sets for disjunctive Datalog programs
• Complexity of super-coherence problems in ASP
• Magic sets for disjunctive Datalog programs
• Database Theory - ICDT 2005
• Magic Sets and their application to data integration

Cited in

(8)

• Scalable neural-probabilistic answer set programming
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Magic sets for disjunctive Datalog programs
• Dynamic magic sets for disjunctive Datalog programs
• The intelligent grounder of DLV
• Enhancing magic sets with an application to ontological reasoning
• Complexity of super-coherence problems in ASP
• Shared aggregate sets in answer set programming

Describes a project that uses

Uses Software

• Gringo

This page was built for publication: Dynamic magic sets and super-coherent answer set programs

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