Computation with varied-strength attacks in abstract argumentation frameworks

Authors:
Paul E. Dunne;Diego C. Martínez;Alejandro J. García;Guillermo R. Simari
Affiliations:
Department of Computer Science, The University of Liverpool, U.K.;Dept. of Computer Science and Engineering, Universidad Nacional del Sur, Bahia Blanca, Argentina;Dept. of Computer Science and Engineering, Universidad Nacional del Sur, Bahia Blanca, Argentina;Dept. of Computer Science and Engineering, Universidad Nacional del Sur, Bahia Blanca, Argentina
Venue:
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Year:
2010

Citing 9
Cited 0

The acceptability semantics for logic programs

Proceedings of the eleventh international conference on Logic programming
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
A Reasoning Model Based on the Production of Acceptable Arguments

Annals of Mathematics and Artificial Intelligence
Computing ideal sceptical argumentation

Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence
Reasoning about preferences in argumentation frameworks

Artificial Intelligence
Inconsistency tolerance in weighted argument systems

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Semi-Stable Semantics

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A dialectic procedure for sceptical, assumption-based argumentation

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006

Quantified Score

Hi-index	0.00

Visualization

Abstract

In abstract frameworks with varied strength attacks (AFV), arguments may attack each other with different strength. An admissible scenario is an admissible set of arguments fulfilling certain strength conditions about defences. In this work we analyze the computational complexity of some decision problems related to the quality of admissible scenarios: checking the property of being top-admissible and the property of being equilibrated. These problems are implying an exhaustive comparison between scenarios, and both of them are shown to be coNP-complete.