The computational complexity of ideal semantics (Q1045987)

From MaRDI portal
Revision as of 08:21, 2 July 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
The computational complexity of ideal semantics
scientific article

    Statements

    title
    The computational complexity of ideal semantics (English)
    0 references
    author
    Paul E. Dunne
    0 references
    publication date
    21 December 2009
    0 references
    zbMATH DE Number
    5650759
    0 references
    zbMATH Keywords
    computational properties of argumentation
    0 references
    abstract argumentation frameworks
    0 references
    assumption-based argumentation
    0 references
    computational complexity
    0 references
    OpenAlex ID
    W2115268056
    0 references
    cites work
    Q4385525
    0 references
    Q3221403
    0 references
    Q4536329
    0 references
    Bounded Query Classes
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1045987&oldid=35144647"
    Powered by MediaWiki