Indepth combinatorial analysis of admissible sets for abstract argumentation (Q2107484): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On principle-based evaluation of extension-based argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-rationalizable choice and self-stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Issue of Reinstatement in Argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for solving reasoning problems in abstract argumentation -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on quasi-kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretical structures in logic programs and default theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational properties of argument systems satisfying graph-theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence in finite argument systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric properties of ideal semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial game theory foundations applied to digraph kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the graded acceptability of arguments in abstract and instantiated argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for decision problems in argument systems under preferred semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On checking skeptical and ideal admissibility in abstract argumentation frameworks / rank
 
Normal rank

Latest revision as of 00:30, 31 July 2024

scientific article
Language Label Description Also known as
English
Indepth combinatorial analysis of admissible sets for abstract argumentation
scientific article

    Statements

    Indepth combinatorial analysis of admissible sets for abstract argumentation (English)
    0 references
    0 references
    0 references
    1 December 2022
    0 references
    acceptability
    0 references
    graph theory
    0 references
    dung semantics
    0 references
    argumentation frameworks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references