Pages that link to "Item:Q4593950"

The following pages link to The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950):

Displayed 2 items.

• A semantic approach to optimize linear datalog programs (Q854685) ‎ (← links)
• On the complexity of single-rule datalog queries. (Q1401945) ‎ (← links)