Augmenting tractable fragments of abstract argumentation (Q1761284): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2012.03.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the resolution-based family of abstract argumentation semantics and its grounded instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation in artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract, argumentation-theoretic approach to default reasoning / 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: A logical account of formal argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the directed feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty / 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: Q4393480 / 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: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of semi-stable and stage semantics in argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Intertranslatability of Argumentation Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fixed-parameter tractable algorithms for abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to tractable answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust semantics for argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and Complexity of Some Formal Inter-agent Dialogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to reason defeasibly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets of quantified Boolean formulas / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2012.03.002 / rank
 
Normal rank

Latest revision as of 09:05, 11 December 2024

scientific article
Language Label Description Also known as
English
Augmenting tractable fragments of abstract argumentation
scientific article

    Statements

    Augmenting tractable fragments of abstract argumentation (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    abstract argumentation
    0 references
    backdoors
    0 references
    computational complexity
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers