Pages that link to "Item:Q1401945"
From MaRDI portal
The following pages link to On the complexity of single-rule datalog queries. (Q1401945):
Displaying 11 items.
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Relaxed notions of schema mapping equivalence revisited (Q359884) (← links)
- The complexity of higher-order queries (Q498405) (← links)
- Query languages for data exchange: beyond unions of conjunctive queries (Q639842) (← links)
- Complexity results of STIT fragments (Q1928487) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Preserving Constraints with the Stable Chase (Q3305357) (← links)
- The power of non-ground rules in Answer Set Programming (Q4593042) (← links)
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules (Q5268431) (← links)
- Guarded Negation (Q5890544) (← links)
