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

From MaRDI portal
Revision as of 04:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of single-rule datalog queries.
scientific article

    Statements

    title
    On the complexity of single-rule datalog queries. (English)
    0 references
    author
    Georg Gottlob
    0 references
    publication date
    19 August 2003
    0 references
    zbMATH DE Number
    1967133
    0 references
    zbMATH Keywords
    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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1401945&oldid=26202852"
    Powered by MediaWiki