Undecidability and intractability results concerning Datalog programs and their persistency numbers (Q2946600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6483108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undecidability and intractability results concerning Datalog programs and their persistency numbers |
scientific article; zbMATH DE number 6483108 |
Statements
Undecidability and intractability results concerning datalog programs and their persistency numbers (English)
0 references
17 September 2015
0 references
boundedness
0 references
Datalog
0 references
intractability
0 references
persistency numbers
0 references
persistent variables
0 references
undecidability
0 references
bounded treewidth hypergraphs
0 references
0.9272706508636476
0 references
0.8326952457427979
0 references
0.807062566280365
0 references
0.8043447136878967
0 references
