Pages that link to "Item:Q4593950"
From MaRDI portal
The following pages link to The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950):
Displaying 4 items.
- A semantic approach to optimize linear datalog programs (Q854685) (← links)
- Boundedness is undecidable for datalog programs with a single recursive rule (Q1123647) (← links)
- Unifications, deunifications, and their complexity (Q1173920) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)