Complexity results and algorithms for extension enforcement in abstract argumentation

摘要: Understanding the dynamics of argumentation frameworks (AFs) is important in study AI. In this work, we focus on so-called extension enforcement problem abstract argumentation. We provide a nearly complete computational complexity map fixed-argument under various major AF semantics, with results ranging from polynomial-time algorithms to completeness for second-level polynomial hierarchy. Complementing results, propose NP-hard based constrained optimization. Going beyond NP, novel counterexample-guided abstraction refinement procedures problems and present empirical prototype system constituting first approach its generality.