We look at a general way of inducing semantics in argumentation theory by means of a mapping defined on the family of 2-valued models of a normal program, which is constructed in terms of the argumentationframework. In this way we define a new argumentation semantics called stable abducible which lies in between the stable and the preferred semantics. The relevance of this new semantics is that it is nonemptyfor any argumentation framework, and coincides with the stable argumentation semantics whenever this is non-empty. We study some of the properties of this semant.