Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.artint.2015.05.003 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2015.05.003 / rank
 
Normal rank

Latest revision as of 07:43, 10 December 2024

scientific article
Language Label Description Also known as
English
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
scientific article

    Statements

    title
    Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (English)
    0 references
    author
    Hannes Strass
    0 references
    Johannes Peter Wallner
    0 references
    publication date
    18 December 2015
    0 references
    zbMATH Keywords
    abstract dialectical frameworks
    0 references
    computational complexity
    0 references
    approximation fixpoint theory
    0 references
    describes a project that uses
    DIAMOND
    0 references
    Carneades
    0 references
    cites work
    Q5282955
    0 references
    Semi-stable semantics
    0 references
    Q4411139
    0 references
    Q4530231
    0 references
    Q2734934
    0 references
    Q3100233
    0 references
    Q4298260
    0 references
    Splitting an operator
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T27
    0 references
    68Q25
    0 references
    68T30
    0 references
    zbMATH DE Number
    6522390
    0 references
    OpenAlex ID
    W1503237869
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q898737&oldid=38528353"
    Powered by MediaWiki