Augmenting tractable fragments of abstract argumentation
type: Item
instance of: scholarly article
title: Augmenting tractable fragments of abstract argumentation
zbMATH Open document ID: 1251.68225
author: Wolfgang Dvořák
author: Sebastian Ordyniak
author: Stefan Szeider
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6106683
zbMATH Keywords: abstract argumentation
zbMATH Keywords: backdoors
zbMATH Keywords: computational complexity
zbMATH Keywords: parameterized complexity
zbMATH Keywords: fixed-parameter tractability
describes a project that uses: OSCAR
MaRDI profile type: Publication
full work available at URL: j.artint.2012.03.002
OpenAlex ID: W2099091523
cites work: On the resolution-based family of abstract argumentation semantics and its grounded instance
cites work: Argumentation in artificial intelligence
cites work: An abstract, argumentation-theoretic approach to default reasoning
cites work: On the Issue of Reinstatement in Argumentation
cites work: A logical account of formal argumentation
cites work: A fixed-parameter algorithm for the directed feedback vertex set problem
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
cites work: Graph theoretical structures in logic programs and default theories
cites work: Q4393480
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: Coherence in finite argument systems.
cites work: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
cites work: Complexity of semi-stable and stage semantics in argumentation frameworks
cites work: On the Intertranslatability of Argumentation Semantics
cites work: Towards fixed-parameter tractable algorithms for abstract argumentation
cites work: Q3160990
cites work: Backdoors to tractable answer set programming
cites work: Parametrized complexity theory.
cites work: Q4198056
cites work: Robust semantics for argumentation frameworks
cites work: Q5710169
cites work: Q3221403
cites work: Properties and Complexity of Some Formal Inter-agent Dialogues
cites work: How to reason defeasibly
cites work: Finding odd cycle transversals.
cites work: Permanents, Pfaffian orientations, and even directed circuits
cites work: Backdoor sets of quantified Boolean formulas
DOI: 10.1016/J.ARTINT.2012.03.002
description: scientific article; zbMATH DE number 6106683