Pages that link to "Item:Q1813949"
From MaRDI portal
The following pages link to Bounds in the propagation of selection into logic programs (Q1813949):
Displayed 7 items.
- Inherent complexity of recursive queries (Q696953) (← links)
- Regular path queries with constraints (Q1307690) (← links)
- A data structure for arc insertion and regular path finding (Q1360677) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- Compilation and evaluation of linear mutual recursions (Q1803866) (← links)
- Linearisability on Datalog programs (Q1884881) (← links)
- A note on fixpoint techniques in data base recursive logic programs (Q3792286) (← links)