We present a common framework for dialectical proof procedures for computing credulous, grounded, ideal and sceptical preferred semantics of abstract argumentation. The framework is based on the notions of dispute derivation and base derivation. Dispute derivation is a dialectical notion first introduced for computing credulous semantics in assumption-based argumentation, and adapted here for computing credulous semantics and grounded semantics. Base derivation is introduced for two purposes: (i) to characterize all preferred extensions containing a given argument, and (ii) to represent backtracking in the search for a dispute derivation. We prove the soundness of the proof procedures for any argumentation frameworks and their completeness for general classes of finitary or finite-branching argumentation frameworks containing the class of finite argumentation frameworks as a subclass.We also discuss related results.
No takes yet. Share an insight, caveat, or question.
Thang et al. (2009) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: