Pages that link to "Item:Q4305348"
From MaRDI portal
The following pages link to About Boundedness for some Datalog and Datalog<sup>neg</sup> Programs (Q4305348):
Displaying 4 items.
- Boundedness is undecidable for datalog programs with a single recursive rule (Q1123647) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950) (← links)
- Characterizing Boundedness in Chase Variants (Q4957209) (← links)