a set of arguments S is admissible iff it is conflict-free and all elements of S are acceptable wrt.
a set of arguments S is complete iff it is admissible and all arguments acceptable wrt.
a set of arguments S is conflict-free iff there exists no attack between a subset of S and an element of S.
the grounded extension of bbase is the least fixed point of the characteristic function.
a set of arguments S is preferred iff it is maximal wrt.
a set of arguments S is self-supporting iff all arguments in S are e-supported by S.
a set of arguments S is stable iff it is conflict-free, self-supporting and for any argument a e-supported by bbase,
where a is not in S, S e-support attacks either a or every set of arguments minimally e-supporting a.