The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
From MaRDI portal
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.