Skeptical Acceptance
Given a semantics , an argument is skeptically accepted iff for every -extension , i.e. .
Remarks
If , every argument is skeptically accepted (Dvořák & Dunne, 2018).
The associated decision problem is .
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.