Complexity of Nonemptiness in Control Argumentation Frameworks[go to overview]
Control argumentation frameworks (CAFs) extend the standard model of argumentation framework (AF) due to Dung, one of the most central frameworks to model discussions among agents in argumentation theory, in a way that takes unquantified uncertainty regarding arguments and attacks into account. Complementing recent work by Skiba et al. for incomplete argumentation frameworks, we study the (nonempty) existence problem for CAFs and fully analyze its computational complexity for the most common semantics.
16.09.21 - 10:15
via Big Blue Button