On the complexity of single-rule datalog queries. (Q1401945): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:01, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of single-rule datalog queries. |
scientific article |
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
