Pages that link to "Item:Q3541701"
From MaRDI portal
The following pages link to The Complexity of Conjunctive Query Answering in Expressive Description Logics (Q3541701):
Displaying 11 items.
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Modal definability of first-order formulas with free variables and query answering (Q2446543) (← links)
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies (Q2680773) (← 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 Description Logics: The Knots Approach (Q3638272) (← links)
- Description Logics (Q3638996) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
