Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity

Authors: Stéphane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit

JAIR 2017 | Venue PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We treat this question of rationalisability of a profile as an algorithmic problem and identify tractable and intractable cases. In doing so, we distinguish different constraints on admissible rationalisations, e.g., concerning the types of preferences used or the number of distinct values involved. We also distinguish two different semantics for rationalisability, which differ in the assumptions made on how agents treat attacks between arguments they do not report.
Researcher Affiliation Academia Stéphane Airiau EMAIL LAMSADE, Université Paris-Dauphine PSL Research University Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16, France Elise Bonzon EMAIL LIPADE, Université Paris Descartes 45 rue des Saints Pères, 75006 Paris, France Ulle Endriss EMAIL ILLC, University of Amsterdam Science Park, 1090 GE Amsterdam, The Netherlands Nicolas Maudet EMAIL LIP6, UPMC Université Paris 6, Sorbonne Universités 4 place Jussieu, 75005 Paris, France Julien Rossit EMAIL LIPADE, Université Paris Descartes 45 rue des Saints Pères, 75006 Paris, France
Pseudocode No The paper describes algorithmic concepts and proofs but does not include any structured pseudocode or algorithm blocks.
Open Source Code No The paper presents theoretical results and complexity analysis for the rationalisability problem and does not mention any associated open-source code release.
Open Datasets No The paper discusses abstract argumentation frameworks and uses examples to illustrate theoretical concepts, but it does not mention or provide access information for any publicly available or open datasets.
Dataset Splits No The paper focuses on theoretical analysis and does not involve empirical experiments requiring dataset splits.
Hardware Specification No The paper describes theoretical results and does not report on experiments that would require specific hardware specifications.
Software Dependencies No The paper is theoretical and does not describe any experimental setup or software dependencies with version numbers.
Experiment Setup No The paper presents theoretical characterizations and complexity analysis, and therefore does not include details on experimental setup or hyperparameters.