Necessary Acceptance

Given a semantics σ\sigma, an argument a∈Aa \in A is necessarily credulously (resp. skeptically) accepted in an iAF I=(A,A?,R,R?)I = (A, A^?, R, R^?) iff aa is credulously (resp. skeptically) accepted in every completion.

Reference

Baumeister, D., Järvisalo, M., Neugebauer, D., Niskanen, A. & Rothe, J. (2021). Acceptance in Incomplete Argumentation Frameworks. Artificial Intelligence, 295, 103470.