Data Complexity in the $\mathcal{EL}$ Family of Description Logics
From MaRDI portal
Publication:3498478
DOI10.1007/978-3-540-75560-9_25zbMath1137.68593MaRDI QIDQ3498478
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
Related Items
Reasoning and Query Answering in Description Logics, Unnamed Item, View-based query answering in description logics: semantics and complexity, Tractability and intractability of controlled languages for data access, Tractable query answering and rewriting under description logic constraints, Finding models through graph saturation, 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, Inconsistency-Tolerant Querying of Description Logic Knowledge Bases, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Unnamed Item, Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$, Ontologies and Databases: The DL-Lite Approach