Pages that link to "Item:Q676421"
From MaRDI portal
The following pages link to On the equivalence of recursive and nonrecursive Datalog programs (Q676421):
Displaying 12 items.
- Decidable containment of recursive queries (Q555766) (← links)
- Containment of conjunctive queries on annotated relations (Q639858) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Unifications, deunifications, and their complexity (Q1173920) (← links)
- Permutation dependency in datalog programs (Q1208139) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- A single recursive predicate is sufficient for pure datalog (Q1891166) (← links)
- A note on fixpoint techniques in data base recursive logic programs (Q3792286) (← links)
- (Q3798292) (← links)
- (Q5091125) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)