Pages that link to "Item:Q1123651"
From MaRDI portal
The following pages link to Data independent recursion in deductive databases (Q1123651):
Displaying 18 items.
- Decidable containment of recursive queries (Q555766) (← links)
- A time bound on the materialization of some recursively defined views (Q578941) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Domain-independent formulas and databases (Q1092679) (← links)
- Controlling recursive inference (Q1097714) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- The Alexander Method - a technique for the processing of recursive axioms in deductive databases (Q1820593) (← links)
- Fixpoint strategies for deductive databases (Q1823737) (← links)
- One-sided recursions (Q2638765) (← links)
- Eliminating Recursion from Monadic Datalog Programs on Trees (Q2946356) (← links)
- Chase of Recursive Queries (Q3401938) (← links)
- PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE (Q4528765) (← links)
- (Q5091266) (← links)
- Recursive query processing in predicate-goal graph (Q5096200) (← links)
- About boundedness for some datalog and DATALOGneg programs (Q5096840) (← links)
- Perspectives of System Informatics (Q5902427) (← links)
- Substitution-based compilation of extended rules in deductive databases (Q6488522) (← links)