Pages that link to "Item:Q5268431"
From MaRDI portal
The following pages link to On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules (Q5268431):
Displaying 4 items.
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms (Q2941737) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- Can One Escape Red Chains? (Q5145324) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)