Abstract argumentation and Dung’s framework are popular for modeling and evaluating arguments in artificial intelligence. We consider various counting problems in abstract argumentation under practical aspects. We revisit algorithms and establish a framework that employs dynamic programming on tree decompositions for counting extensions of abstract argumentation frameworks under admissible, stable, and complete semantics. We provide an empirical evaluation and investigate conditions under which our approach is useful.