Pages that link to "Item:Q1104095"
From MaRDI portal
The following pages link to Parallel complexity of logical query programs (Q1104095):
Displaying 19 items.
- Exploiting parallelism in coalgebraic logic programming (Q280198) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Why a single parallelization strategy is not enough in knowledge bases (Q686639) (← links)
- Logical query optimization by proof-tree transformation (Q686647) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Distribution policies for Datalog (Q778538) (← links)
- OLDTNF-based evaluation method for handling recursive queries in deductive databases (Q1286645) (← links)
- On the monotonicity of (LDL) logic programs with set. (Q1353958) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Bounds in the propagation of selection into logic programs (Q1813949) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming (Q3067470) (← links)
- Distribution Policies for Datalog. (Q3305363) (← links)
- Modern Datalog Engines (Q5101659) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Rational index of languages defined by grammars with bounded dimension of parse trees (Q6580079) (← links)
