A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662)
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: A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs |
scientific article; zbMATH DE number 985121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs |
scientific article; zbMATH DE number 985121 |
Statements
A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (English)
0 references
28 February 1997
0 references
Databases
0 references
Theory of computation
0 references
