Abstract One criticism often advanced against abstract argumentation frameworks (AFs), is that these consider only one form of interaction between atomic arguments: speci?cally that an argument attacks another. Attempts to broaden the class of relationships include bipolar frameworks, where arguments support others, and abstract dialectical frameworks (ADFs). The latter, allow “acceptance” of an argument, x, to be predicated on a given propositional function, Cx , dependent on the corresponding acceptance of its parents, i.e. those y for which y, x occurs. Although offering a richly expressive formalism subsuming both standard and bipolar AFs, an issue that arises with ADFs is whether this expressiveness is achieved in a manner that would be infeasible within standard AFs. Can the semantics used in ADFs be mapped to some AF semantics? How many arguments are needed in an AF to “simulate” an ADF? We show that (in a formally de?ned sense) any ADF can be simulated by an AF of similar size and that this translation can be realised by a polynomial time algorithm. Keywords: Argumentation, Knowledge representation