Pages that link to "Item:Q3498478"
From MaRDI portal
The following pages link to Data Complexity in the $\mathcal{EL}$ Family of Description Logics (Q3498478):
Displayed 14 items.
- View-based query answering in description logics: semantics and complexity (Q414845) (← links)
- Tractability and intractability of controlled languages for data access (Q692195) (← links)
- Tractable query answering and rewriting under description logic constraints (Q975872) (← links)
- Finding models through graph saturation (Q1785854) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases (Q2970304) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ (Q3532465) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- (Q5232905) (← links)
- Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures (Q6152660) (← links)