Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1]
The Effect of Preferences in Abstract Argumentation under a Claim-Centric View
Authors: Michael Bernreiter, Wolfgang Dvořák, Anna Rapberger, Stefan Woltran
JAIR 2024 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we study the effect of preferences in abstract argumentation under a claim-centric perspective. ... These classes behave differently from each other with respect to semantic properties and computational complexity, but also in connection with structured argumentation formalisms such as assumption-based argumentation. ... Our results highlight a significant advantage of a particular reduction when it comes to admissible based semantics: under this modification, subset-maximization (as used in preferred semantics for example) on the argument-level coincides with subset-maximization on the claim-level. Moreover, this modification preserves I-maximality. ... We investigate the complexity of reasoning for CAFs with preferences. ... Finally, we examine the relationship between CAFs with preferences and assumption-based argumentation with preferences (ABA+). ... This paper is organized as follows. ... In Section 3, we introduce Preference-based CAFs (PCAFs) ... We characterize the novel CAF classes based on the preference reductions in Section 4, study the I-maximality of the semantics in Section 5, and their computational complexity in Section 6. We then investigate relationship between PCAFs and ABA+ in Section 7 and conclude in Section 8. |
| Researcher Affiliation | Academia | Michael Bernreiter EMAIL Wolfgang Dvoˇr ak EMAIL Institute of Logic and Computation, TU Wien, Austria Anna Rapberger EMAIL Department of Computing, Imperial College London, UK Stefan Woltran EMAIL Institute of Logic and Computation, TU Wien, Austria |
| Pseudocode | No | The paper focuses on theoretical contributions including algorithm design, proofs, and formal analysis, but it does not contain any structured pseudocode or algorithm blocks within its content. |
| Open Source Code | No | The paper does not contain any explicit statement about releasing source code for the methodology described, nor does it provide any links to code repositories. |
| Open Datasets | No | The paper is purely theoretical and does not involve empirical experiments with datasets. Therefore, it does not mention or provide access information for any open datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical evaluation with datasets, so there is no mention of dataset splits for reproducibility. |
| Hardware Specification | No | The paper is theoretical and does not report on experiments requiring specific hardware. Therefore, no hardware specifications are provided. |
| Software Dependencies | No | The paper is theoretical and does not detail any experimental implementation that would require specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not involve any empirical experiments. Consequently, it does not include details about an experimental setup, hyperparameters, or training configurations. |