Complexity of Nonemptiness in Control Argumentation Frameworks.

Control argumentation frameworks (CAFs) [4] extend the standard model of argumentation framework (AF) due to Dung [6] in a way that takes unquantified uncertainty regarding arguments and attacks into account. Complementing recent work by Skiba et al. [21] for incomplete argumentation frameworks, we study the (nonempty) existence problem for CAFs and fully analyze its computational complexity for the most common semantics.