The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs |
scientific article; zbMATH DE number 6807573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs |
scientific article; zbMATH DE number 6807573 |
Statements
The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (English)
0 references
16 November 2017
0 references
0.87142444
0 references
0.8545212
0 references
0 references
0.82877284
0 references
0.8244909
0 references
0.8232849
0 references
0.8154466
0 references
0.8147523
0 references
