The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950)
From MaRDI portal
scientific article; zbMATH DE number 6807573
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
