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

DOI10.1007/978-3-540-75560-9_25zbMath1137.68593OpenAlexW61479352MaRDI QIDQ3498478

Carsten Lutz, Adila Krisnadhi

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)

Related Items (14)

A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Unnamed Item ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ View-based query answering in description logics: semantics and complexity ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ ⋮ Reasoning and Query Answering in Description Logics ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Tractability and intractability of controlled languages for data access ⋮ Tractable query answering and rewriting under description logic constraints ⋮ Finding models through graph saturation ⋮ Ontologies and Databases: The DL-Lite Approach

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