Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog

DOI10.1016/j.artint.2019.103220zbMath1476.68250arXiv1912.07475OpenAlexW2995760890WikidataQ78917577 ScholiaQ78917577MaRDI QIDQ2302291

Shqiponja Ahmetaj, Magdalena Ortiz, Mantas Šimkus

Publication date: 26 February 2020

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

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

zbMATH Keywords

Datalogdescription logicssuccinctnessquery rewritingrelative expressivenessontology-mediated query answeringclosed predicates

Mathematics Subject Classification ID

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

Related Items (5)

Query answering in circumscribed OWL2 profiles ⋮ Unnamed Item ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Fragments of Bag Relational Algebra: Expressiveness and Certain Answers

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Data complexity of query answering in description logics
• Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
• Tractable query answering and rewriting under description logic constraints
• Answering regular path queries in expressive description logics via alternating tree-automata
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Combining answer set programming with description logics for the semantic web
• The price of query rewriting in ontology-based data access
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Reasoning in description logics by a reduction to disjunctive datalog
• Query Answering with DBoxes is Hard
• Rewriting Guarded Negation Queries
• Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Reconciling description logics and rules
• Querying Visible and Invisible Information
• Ontology-Based Data Access
• Capturing Missing Tuples and Missing Values
• The Description Logic Handbook
• Combining decidability paradigms for existential rules

This page was built for publication: Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog