Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies

DOI10.1016/J.ARTINT.2016.03.006zbMATH Open1357.68228OpenAlexW2309621853MaRDI QIDQ286087FDOQ286087

Authors: Mark Kaminski, Yavor Nenov, Bernardo Cuenca Grau 

Publication date: 19 May 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.03.006

Recommendations

• Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
• Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
• Tractable reasoning with DL-programs over Datalog-rewritable description logics
• Rewriting guarded existential rules into small Datalog programs
• The price of query rewriting in ontology-based data access

zbMATH Keywords

query answeringDatalog rewritabilitydescription logicsdisjunctive Datalogknowledge representationontologiesreasoningrule languages

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites Work

• Propositional semantics for disjunctive logic programs
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Complexities of Horn description logics
• The DL-Lite Family and Relations
• The DLV system for knowledge representation and reasoning
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Resolution theorem proving
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Title not available (Why is that?)
• Practical reasoning for very expressive description logics
• Reasoning with minimal models: efficient algorithms and applications
• An observation on time-storage trade off
• On the complexity of single-rule datalog queries.
• Magic sets for disjunctive Datalog programs
• Linearisability on Datalog programs
• Reasoning in description logics by a reduction to disjunctive datalog
• Unfold/fold transformations for disjunctive logic programs
• Type-elimination-based reasoning for the description logic \(\mathcal {SHIQ}b_s\) using decision diagrams and disjunctive Datalog
• On the complexity of ontological reasoning under disjunctive existential rules
• Tractable reasoning with DL-programs over Datalog-rewritable description logics
• Manifold answer-set programs and their applications
• Foundations of Rule-Based Query Answering
• Title not available (Why is that?)
• Title not available (Why is that?)
• More on tractable disjunctive Datalog
• Ontology-Based Data Access
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction
• Engineering an Incremental ASP Solver
• Title not available (Why is that?)
• Tractable query answering and rewriting under description logic constraints

Cited In (9)

• Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
• Maintenance of datalog materialisations revisited
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
• A tetrachotomy of ontology-mediated queries with a covering axiom
• Tractable reasoning with DL-programs over Datalog-rewritable description logics
• Defining Datalog in Rewriting Logic
• Title not available (Why is that?)
• Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).

Uses Software

• Datalog

This page was built for publication: Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies

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