Computation with varied-strength attacks in abstract argumentation frameworks

PAUL E. DUNNE; DIEGO C. MARTINEZ; ALEJANDRO J. GARCÍA; GUILLERMO R. SIMARI

Conferencia; Computational Models of Arguments; 2010

 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 admis sible scenarios: checking the property of being top-admissible and the property of being equilibrated. These problems are implying an exhaus-tive comparison between scenarios, and both of them are shown to beconp?complete.