Data Complexity in the \mathcal{EL} Family of Description Logics

DOI10.1007/978-3-540-75560-9_25zbMATH Open1137.68593OpenAlexW61479352MaRDI QIDQ3498478FDOQ3498478

Authors: Adila Krisnadhi, Carsten Lutz 

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_25

Recommendations

• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
• Data complexity of query answering in description logics
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes

Mathematics Subject Classification ID

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

Cited In (21)

• Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
• Tractability and intractability of controlled languages for data access
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures
• View-based query answering in description logics: semantics and complexity
• Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
• The data complexity of ontology-mediated queries with closed predicates
• Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Tractable query answering and rewriting under description logic constraints
• Querying the unary negation fragment with regular path expressions
• A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
• Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete
• Reasoning and query answering in description logics
• Tractable extensions of the description logic \(\mathcal{EL}\) with numerical datatypes
• Answering regular path queries in expressive description logics via alternating tree-automata
• Ontologies and Databases: The DL-Lite Approach
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• Finding models through graph saturation
• Horn knowledge bases in regular description logics with PTime data complexity

This page was built for publication: Data Complexity in the $\mathcal{EL}$ Family of Description Logics

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