Skeptical Acceptance

Given a semantics σ\sigma, an argument a∈Aa \in A is skeptically accepted iff a∈Ea \in E for every σ\sigma-extension E∈σ(F)E \in \sigma(F), i.e. a∈skepσ(F)=⋂σ(F)a \in \mathsf{skep}_\sigma(F) = \bigcap \sigma(F).

Remarks

If σ(F)=∅\sigma(F) = \emptyset, every argument is skeptically accepted (Dvořák & Dunne, 2018).

The associated decision problem is Skeptσ\textsc{Skept}_\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