Conceptual rationalistic systems (ADFs) have as of late been proposed as adaptable speculation of Dung's theoretical argumentation structures (AFs). In this paper, we present an exhaustive examination of the computational intricacy of ADFs. Our outcomes show that while ADFs are one level up in the polynomial order contrasted with AFs, there is a valuable subclass of ADFs which is all around as mind-boggling as AFs while ostensibly offering additional displaying limits. As a specialized vehicle, we utilize the estimation fixpoint hypothesis of Denecker, Marek and Truszczyński, in this manner showing that it is additionally a helpful instrument for intricacy examination of administrator-based semantics.
