Data complexity of query answering in description logics

DOI10.1016/j.artint.2012.10.003zbMath1270.68294OpenAlexW2104356397WikidataQ62048029 ScholiaQ62048029MaRDI QIDQ360130

Domenico Lembo, Giuseppe De Giacomo, Riccardo Rosati, Maurizio Lenzerini, Diego Calvanese

Publication date: 26 August 2013

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212001257

Mathematics Subject Classification ID

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

Related Items (39)

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization ⋮ Tractable approximate deduction for OWL ⋮ Query answering in circumscribed OWL2 profiles ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ A false sense of security ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Unnamed Item ⋮ Forgetting for knowledge bases in DL-lite ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ View-based query answering in description logics: semantics and complexity ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ Designing efficient controlled languages for ontologies ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ Recent Advances in Datalog$$^\pm $$ ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Reasoning on anonymity in Datalog ⋮ Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ ⋮ Tractable reasoning and efficient query answering in description logics: The DL-Lite family ⋮ Reasoning in description logics by a reduction to disjunctive datalog ⋮ Data complexity of query answering in expressive description logics via tableaux ⋮ Tractability and intractability of controlled languages for data access ⋮ Top-\(k\) retrieval for ontology mediated access to relational databases ⋮ Linking Data to Ontologies ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Formal Properties of Modularisation ⋮ Unnamed Item ⋮ Foundations of Temporal Conceptual Data Models ⋮ Conceptual Modeling for Data Integration ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Query Answering with DBoxes is Hard ⋮ Unnamed Item ⋮ Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting ⋮ DL-Lite with Temporalised Concepts, Rigid Axioms and Roles ⋮ On the scalability of description logic instance retrieval ⋮ Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies ⋮ Rewriting Conjunctive Queries over Description Logic Knowledge Bases

This page was built for publication: Data complexity of query answering in description logics