Pages that link to "Item:Q975872"
From MaRDI portal
The following pages link to Tractable query answering and rewriting under description logic constraints (Q975872):
Displaying 13 items.
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Top-\(k\) retrieval for ontology mediated access to relational databases (Q712661) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- (Q3305347) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- Reasoning on anonymity in Datalog (Q5240228) (← links)
- Scalable Reasoning by Abstraction Beyond DL-Lite (Q5268436) (← links)
- (Q5377468) (← links)
