Boundedness is undecidable for datalog programs with a single recursive rule (Q1123647)
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: Publication:1123647 |
scientific article; zbMATH DE number 4110167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Boundedness is undecidable for datalog programs with a single recursive rule |
scientific article; zbMATH DE number 4110167 |
Statements
Boundedness is undecidable for datalog programs with a single recursive rule (English)
0 references
1989
0 references
data processing
0 references
databases
0 references
deductive databases
0 references
boundedness
0 references
datalog
0 references
0.9201224446296692
0 references
0.9201224446296692
0 references
0.8737329840660095
0 references
0.8548518419265747
0 references
0.8548518419265747
0 references
