Complexity of abstract argumentation under a claim-centric view (Q785236): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2020.103290 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Logical limits of abstract argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general semi-structured formalism for computational argumentation: definition, properties, and examples of application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4576188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the evaluation of argumentation formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between logic programming semantics and argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical argumentation principles, sequents, and nondeterministic matrices / 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: Q3785987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of assumption-based argumentation for default reasoning. / 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: Q4503944 / 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: The computational complexity of ideal semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence in finite argument systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / 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: On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks / 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: Instantiating abstract argumentation with classical logic arguments: postulates and properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``A general account of argumentation with preferences'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete extensions in argumentation coincide with 3-valued stable models in logic programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2020.103290 / rank
 
Normal rank

Latest revision as of 03:33, 10 December 2024

scientific article
Language Label Description Also known as
English
Complexity of abstract argumentation under a claim-centric view
scientific article

    Statements

    Complexity of abstract argumentation under a claim-centric view (English)
    0 references
    0 references
    0 references
    6 August 2020
    0 references
    abstract argumentation
    0 references
    computational complexity
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers