Enhancing Magic Sets with an Application to Ontological Reasoning

DOI10.1017/S1471068419000115zbMath1434.68560arXiv1907.08424OpenAlexW3104564450WikidataQ127226082 ScholiaQ127226082MaRDI QIDQ5108494

Nicola Leone, Mario Alviano, Pierfrancesco Veltri, Jessica Zangari

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08424

zbMATH Keywords

nonmonotonic reasoningDatalogquery answeringmagic setsaggregations

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items

DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries, Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)

Uses Software

• DLV
• WASP
• DLV2

Cites Work

• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Bottom-up evaluation and query optimization of well-founded models
• Logic programs with abstract constraint atoms: the role of computations
• Extending and implementing the stable model semantics
• Magic sets for disjunctive Datalog programs
• On the declarative and procedural semantics of logic programs
• Pushing extrema aggregates to optimize logic queries
• Evaluation of disjunctive programs in WASP
• The ASP system DLV2
• Vicious Circle Principle and Logic Programs with Aggregates
• Anytime Computation of Cautious Consequences in Answer Set Programming
• Logic programs with propositional connectives and aggregates
• Dynamic Magic Sets for Programs with Monotone Recursive Aggregates
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• On the power of magic
• Well-founded and stable semantics of logic programs with aggregates
• Negation as failure using tight derivations for general logic programs
• Efficient bottom-up computation of queries on stratified databases
• The well-founded semantics for general logic programs
• Modular stratification and magic sets for Datalog programs with negation
• Shared aggregate sets in answer set programming
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• Anytime answer set optimization via unsatisfiable core shrinking
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Complexity of super-coherence problems in ASP
• Programming Languages and Systems
• Optimization of bound disjunctive queries with constraints