Complexity of abstract argumentation under a claim-centric view
type: Item
instance of: scholarly article
title: Complexity of abstract argumentation under a claim-centric view
zbMATH Open document ID: 1451.68261
author: Wolfgang Dvořák
author: Stefan Woltran
published in: Artificial Intelligence
publication date: 2020-08-06T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7228998
zbMATH Keywords: abstract argumentation
zbMATH Keywords: computational complexity
zbMATH Keywords: fixed-parameter tractability
MaRDI profile type: Publication
full work available at URL: j.artint.2020.103290
OpenAlex ID: W3024467804
cites work: Logical limits of abstract argumentation frameworks
cites work: Easy problems for tree-decomposable graphs
cites work: Computational Complexity
cites work: Q3160990
cites work: A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
cites work: Q4576188
cites work: Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: On the evaluation of argumentation formalisms
cites work: On the equivalence between logic programming semantics and argumentation semantics
cites work: Logical argumentation principles, sequents, and nondeterministic matrices
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
cites work: Q3785987
cites work: Q4385531
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: On the computational complexity of assumption-based argumentation for default reasoning.
cites work: Graph theoretical structures in logic programs and default theories
cites work: Q4503944
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Computational properties of argument systems satisfying graph-theoretic constraints
cites work: The computational complexity of ideal semantics
cites work: Coherence in finite argument systems.
cites work: Augmenting tractable fragments of abstract argumentation
cites work: Towards fixed-parameter tractable algorithms for abstract argumentation
cites work: On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks
cites work: Complexity of semi-stable and stage semantics in argumentation frameworks
cites work: On the Intertranslatability of Argumentation Semantics
cites work: Instantiating abstract argumentation with classical logic arguments: postulates and properties
cites work: Corrigendum to: ``A general account of argumentation with preferences''
cites work: Q4789446
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Complete extensions in argumentation coincide with 3-valued stable models in logic programming
DOI: 10.1016/J.ARTINT.2020.103290
description: scientific article; zbMATH DE number 7228998