Pages that link to "Item:Q2252521"
From MaRDI portal
The following pages link to Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521):
Displaying 8 items.
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies (Q2680773) (← links)
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms (Q2941737) (← 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)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)
