On the complexity of single-rule datalog queries. (Q1401945)

From MaRDI portal
Revision as of 09:57, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers