… In this paper, we explore the computational cost of argument games with incomplete
information where the (internal) logical structure of arguments is considered. We study strategic …

… to play at a given turn of a dialogue game under Dung’s grounded semantics is an NP-complete
problem even when the problem of deciding whether a conclusion follows from an …

… strategic argumentation, for the aims and semantics we study. From these results we identify
that strategic argumentation … player’s aim and the argumentation semantics, and we present …

… on social commitments and arguments. In Section 3, we present the strategic level of our
framework … Since H ⊣ ¬x is co-NP-complete, the co-NP-completeness of the problem follows. …

… argumentation. They show that a certain element of reasoning within strategic argumentation
is NP-complete. … a player in a strategic argumentation game, and establish their complexity. …

… That work addressed several argumentation semantics, all … semantics does not support
strategic argumentation, in the sense … to collusion depends on the strategic aims of the players. …

… Now, for s ∈ {AD,ST}, the problem s-PCA is NPcomplete and can be decided by the input …
For each AF, we select a query argument uniformly at random from the set of arguments. Now, …

… To address counting aims in strategic argumentation we need to consider the complexity
class PP and related classes. Roughly, PP is the class of decision problems that have more …

… the complexity of problems in the contexts of strategic argumentation (Maher, 2016c, 2016a,
… most non-strict enforcement problems are NP-complete, along with strict enforcement under …

… problem sNONEMPTINESS—this problem is NP-complete, as shown by Dimopoulos and …
Maher [19] presents a model of strategic argumentation, which simulates a game between a …