Dialectical frameworks (ADFs) constitute one of the most general formal approaches within abstract argumentation. Recently, Bengel and Thimm (2025) proposed so-called initial models in ADFs as a suitable concept for “serializing” reasoning, i.e., decomposing reasoning in ADFs step by step. They showed several complexity results of reasoning with initial models. Our contributions in this paper are (i) that we close a gap in their complexity results of verifying initial models by showing DP-completeness, and (ii) based on our complexity results we provide an answer set programming (ASP) implementation to support systems utilizing initial models.