The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Journal of Combinatorial Theory Series B
Coherence in finite argument systems
Artificial Intelligence
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Safe Reduction Rules for Weighted Treewidth
Algorithmica
Computing ideal sceptical argumentation
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approximation Algorithms for Treewidth
Algorithmica
Treewidth computations I. Upper bounds
Information and Computation
Complexity of semi-stable and stage semantics in argumentation frameworks
Information Processing Letters
On Extension Counting Problems in Argumentation Frameworks
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Symmetric argumentation frameworks
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Ant colony optimization for tree decompositions
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Structural properties for deductive argument systems
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
Hi-index | 0.00 |
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have been identified. In particular, Dunne showed that many problems can be solved in linear time for argumentation frameworks of bounded tree-width. However, these tractability results, which were obtained via Courcelle@?s Theorem, do not directly lead to efficient algorithms. The goal of this paper is to turn the theoretical tractability results into efficient algorithms and to explore the potential of directed notions of tree-width for defining larger tractable fragments. As a by-product, we will sharpen some known complexity results.