Credulous Acceptance

Given a semantics $\sigma$ , an argument $a \in A$ is credulously accepted iff $a \in E$ for some $\sigma$ -extension $E \in \sigma(F)$ , i.e. $a \in \mathsf{cred}_\sigma(F) = \bigcup \sigma(F)$ .

Remarks

The associated decision problem is $\textsc{Cred}_\sigma$ .

Reference

Dvořák, W. & Dunne, P.E. (2018). Computational Problems in Formal Argumentation and their Complexity. In: Baroni, P., Gabbay, D., Giacomin, M. & van der Torre, L. (eds.), Handbook of Formal Argumentation, Vol. 1, Chapter 13, pp. 631–688. College Publications.

Referenced by

Necessary Acceptance
Possible Acceptance
Credulous Acceptance Probability
Credulous Acceptance $\textsc{Cred}_\sigma$