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

DOI10.1007/978-3-540-75560-9_25MaRDI QIDQ3498478zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(21)

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

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)