On the complexity of single-rule datalog queries. (Q1401945)
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: On the complexity of single-rule datalog queries. |
scientific article; zbMATH DE number 1967133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of single-rule datalog queries. |
scientific article; zbMATH DE number 1967133 |
Statements
On the complexity of single-rule datalog queries. (English)
0 references
19 August 2003
0 references
Logic programming
0 references
Datalog
0 references
Complexity
0 references
Single rule program
0 references
Sirup clause implication
0 references
Subsumption
0 references
Exponential time
0 references
Expressive power
0 references
Descriptive complexity
0 references
Linear recursion
0 references
0.8133669495582581
0 references
0.8024278879165649
0 references
0.793172299861908
0 references
