Circumscribing DATALOG: expressive power and complexity (Q1127538)

From MaRDI portal
Revision as of 11:10, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Circumscribing DATALOG: expressive power and complexity
scientific article

    Statements

    title
    Circumscribing DATALOG: expressive power and complexity (English)
    0 references
    author
    Marco Cadoli
    0 references
    Luigi Palopoli
    0 references
    publication date
    13 August 1998
    0 references
    zbMATH Keywords
    DATALOG semantics
    0 references
    data complexity
    0 references
    cites work
    Q4864249
    0 references
    Q4035348
    0 references
    Q4375822
    0 references
    Q4058132
    0 references
    Q4198056
    0 references
    Q4385543
    0 references
    Q5750390
    0 references
    Q3221403
    0 references
    Q3348437
    0 references
    Q3477931
    0 references

    Identifiers

    zbMATH DE Number
    1189769
    0 references
    OpenAlex ID
    W2090079575
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1127538&oldid=37417392"
    Powered by MediaWiki