Abstract: Stable class and argumentation semantics are two outstanding unifying frameworks in the research of declarative semantics for logic programs, and they unify some very important semantics. Because they have different intuition and concepts, their relation is not clear yet. It is shown that their fundamental concepts are equivalent under normal logic programs, so they have the same unifying capability. Based on such a result, a constructive procedure is presented for computing the promising argumentation semantics.