Pages that link to "Item:Q1123647"
From MaRDI portal
The following pages link to Boundedness is undecidable for datalog programs with a single recursive rule (Q1123647):
Displaying 5 items.
- A semantic approach to optimize linear datalog programs (Q854685) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Characterizing Boundedness in Chase Variants (Q4957209) (← links)
- About boundedness for some datalog and DATALOGneg programs (Q5096840) (← links)
