This analysis generalizes serialisability in argumentation semantics for initial models in ADFs, indicating its relevance in computational complexity.
We introduce initial models for abstract dialectical frameworks (ADFs) as a notion of minimal justifiable valuations and based on that, generalise the concept of serialisability of argumentation semantics to ADFs. In particular, we show that the characteristic operator-based semantics for ADFs can be characterised through serialisation sequences, which are, essentially, decompositions of a model into a series of initial models, representing a more fine-grained view into why a model is acceptable wrt. the semantics. We also analyse the computational complexity of tasks related to initial models.
No takes yet. Share an insight, caveat, or question.
Bengel et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: