Easy problems for tree-decomposable graphs
Journal of Algorithms
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Argumentation in artificial intelligence
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Inconsistency tolerance in weighted argument systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Symmetric argumentation frameworks
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Algorithms and complexity results for persuasive argumentation
Artificial Intelligence
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
| Hi-index | 0.00 |
Value-based argumentation frameworks (VAFs) have proven to be a useful development of Dung's seminal model of argumentation in providing a rational basis for distinguishing mutually incompatible yet individually acceptable sets of arguments. In classifying argument status within value-based frameworks two main decision problems arise: subjective acceptance (SBA) and objective acceptance (OBA). These problems have proven to be somewhat resistant to efficient algorithmic approaches (the general cases being NP--complete and coNP--complete) even when very severe limitations are placed on the structure of the supporting Dung-style framework. Although using the number of values (k) represented within a given vaf leads to fixed parameter tractable (FPT) methods, these are not entirely satisfactory: the rate of growth of the parameter function (k!) making such methods unacceptable in cases where k is moderately large, e.g. k ≥ 20. In this paper we consider an alternative approach to the development of practical algorithms in value-based argumentation. In particular cases this leads to polynomial (in |χ|) methods, i.e. irrespective of the value of k. More general examples are shown to be decidable in O(f(k)|χ|2) steps where f(k)=o(k!) resulting in worst-case run times that significantly improve upon enumerating all value orderings.