Data complexity of query answering in description logics

DOI10.1016/J.ARTINT.2012.10.003zbMATH Open1270.68294OpenAlexW2104356397WikidataQ62048029 ScholiaQ62048029MaRDI QIDQ360130FDOQ360130

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

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

Cited In (44)

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

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

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