Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies

DOI10.1016/j.artint.2016.03.006zbMath1357.68228OpenAlexW2309621853MaRDI QIDQ286087

Yavor Nenov, Mark Kaminski, 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

zbMATH Keywords

knowledge representationreasoningdescription logicsquery answeringontologiesDatalog rewritabilitydisjunctive Datalogrule languages

Mathematics Subject Classification ID

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

Related Items (5)

A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Unnamed Item ⋮ Maintenance of datalog materialisations revisited

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unfold/fold transformations for disjunctive logic programs
• Tractable query answering and rewriting under description logic constraints
• Reasoning with minimal models: efficient algorithms and applications
• An observation on time-storage trade off
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• On the complexity of single-rule datalog queries.
• Magic sets for disjunctive Datalog programs
• Linearisability on Datalog programs
• Propositional semantics for disjunctive logic programs
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Reasoning in description logics by a reduction to disjunctive datalog
• Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog
• On the Complexity of Ontological Reasoning under Disjunctive Existential Rules
• Complexities of Horn Description Logics
• Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
• Manifold Answer-Set Programs and Their Applications
• Foundations of Rule-Based Query Answering
• The DL-Lite Family and Relations
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Practical reasoning for very expressive description logics
• More on tractable disjunctive Datalog
• Ontology-Based Data Access
• The DLV system for knowledge representation and reasoning
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction
• Engineering an Incremental ASP Solver

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