Pages that link to "Item:Q945056"
From MaRDI portal
The following pages link to Data complexity of query answering in expressive description logics via tableaux (Q945056):
Displaying 17 items.
- View-based query answering in description logics: semantics and complexity (Q414845) (← links)
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
- On the complexity of queries in the logical data model (Q688665) (← links)
- Tractability and intractability of controlled languages for data access (Q692195) (← links)
- Exploiting conjunctive queries in description logic programs (Q1028641) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Data-complexity of the two-variable fragment with counting quantifiers (Q2389348) (← links)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family (Q2462646) (← links)
- Query answering with DBoxes is hard (Q2825409) (← links)
- Hybrid logics and ontology languages (Q2867944) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Query Answering in Description Logics: The Knots Approach (Q3638272) (← links)
- Description Logics (Q3638996) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- (Q5232905) (← links)
- Linking Data to Ontologies (Q5445729) (← links)