A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Audiences in argumentation frameworks
Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Elements of Argumentation
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Tractability in Value-based Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Algorithms and Complexity Results for Persuasive Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Partial semantics of argumentation
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Toward incremental computation of argumentation semantics: A decomposition-based approach
Annals of Mathematics and Artificial Intelligence
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
Hi-index | 0.00 |
The study of arguments as abstract entities and their interaction as introduced by Dung (1995) [1] has become one of the most active research branches within Artificial Intelligence and Reasoning. A main issue for abstract argumentation systems is the selection of acceptable sets of arguments. Value-based argumentation, as introduced by Bench-Capon (2003) [8], extends Dung@?s framework. It takes into account the relative strength of arguments with respect to some ranking representing an audience: an argument is subjectively accepted if it is accepted with respect to some audience, it is objectively accepted if it is accepted with respect to all audiences. Deciding whether an argument is subjectively or objectively accepted, respectively, are computationally intractable problems. In fact, the problems remain intractable under structural restrictions that render the main computational problems for non-value-based argumentation systems tractable. In this paper we identify nontrivial classes of value-based argumentation systems for which the acceptance problems are polynomial-time tractable. The classes are defined by means of structural restrictions in terms of the underlying graphical structure of the value-based system. Furthermore we show that the acceptance problems are intractable for two classes of value-based systems that where conjectured to be tractable by Dunne (2007) [12].