Pages that link to "Item:Q2941737"
From MaRDI portal
The following pages link to Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms (Q2941737):
Displaying 8 items.
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Regular queries on graph databases (Q2402613) (← 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)
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules (Q5268431) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- Reasoning with ontologies (Q6602220) (← links)
