Initial Models and Serialisability in Abstract Dialectical Frameworks

Authors: Lars Bengel, Matthias Thimm

IJCAI 2025 | Venue PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical 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. 1. We define the notion of initial models for ADFs and show that they are a generalisation of initial sets in AFs (Section 3). 2. We define serialisability and serialisation sequences for ADFs, and analyse their properties (Section 4). 3. We characterise most admissibility-based semantics for ADFs via serialisation sequences (Section 5). 4. We provide complexity results for various tasks related to initial models in ADFs (Section 6).
Researcher Affiliation Academia Lars Bengel , Matthias Thimm Artificial Intelligence Group, University of Hagen, Germany EMAIL
Pseudocode No The paper describes definitions, theorems, lemmas, and examples but does not contain any structured pseudocode or algorithm blocks.
Open Source Code No The paper makes no mention of open-source code for the methodology described. It only states: 'Omitted proofs for all technical results can be found in an online appendix1. 1https://doi.org/10.5281/zenodo.15357088', which refers to proofs, not code.
Open Datasets No The paper is theoretical and focuses on formal definitions, characterizations, and complexity analysis of abstract dialectical frameworks. It does not describe any experiments that would utilize datasets.
Dataset Splits No The paper does not use any datasets for experiments, therefore, no dataset split information is provided.
Hardware Specification No The paper is theoretical and does not report on any experiments that would require specific hardware specifications.
Software Dependencies No The paper is theoretical and focuses on formal concepts and computational complexity. It does not describe any implemented systems or experiments that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not report on any experimental setup details or hyperparameters.