Complexity of abstract argumentation under a claim-centric view

DOI10.1016/J.ARTINT.2020.103290zbMath1451.68261OpenAlexW3024467804MaRDI QIDQ785236

Stefan Woltran, Wolfgang Dvořák

Publication date: 6 August 2020

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103290

zbMATH Keywords

computational complexityfixed-parameter tractabilityabstract argumentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ The complexity landscape of claim-augmented argumentation frameworks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• On the evaluation of argumentation formalisms
• Computational properties of argument systems satisfying graph-theoretic constraints
• The computational complexity of ideal semantics
• Logical argumentation principles, sequents, and nondeterministic matrices
• Corrigendum to: ``A general account of argumentation with preferences
• A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
• Towards fixed-parameter tractable algorithms for abstract argumentation
• Augmenting tractable fragments of abstract argumentation
• Coherence in finite argument systems.
• On the computational complexity of assumption-based argumentation for default reasoning.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• On the equivalence between logic programming semantics and argumentation semantics
• On the Intertranslatability of Argumentation Semantics
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Logical limits of abstract argumentation frameworks
• On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks
• Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems
• Computational Complexity
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

This page was built for publication: Complexity of abstract argumentation under a claim-centric view