Compact Argumentation Frameworks
Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are characterized by the feature that each argument of the AF occurs in at least one extension. This not only guarantees a certain notion of fairness; compact AFs are thus also minimal in the sense that no argument can be removed without changing the outcome. We address the following questions in the paper: (1) How are the classes of compact AFs related for different semantics? (2) Under which circumstances can AFs be transformed into equivalent compact ones? (3) Finally, we show that compact AFs are indeed a non-trivial subclass, since the verification problem remains coNP-hard for certain semantics.
Code (0)
등록된 구현이 없습니다.
Tasks
Abstract ArgumentationFairnessSimilar Papers 제목 키워드 기반
Splitting Argumentation Frameworks with Collective Attacks and Supports
This work proposes novel splitting techniques for argumentation formalisms that incorporate supports between defeasible elements. We base our studies on bipolar set-based argumentation frameworks (BSAFs) which generalize…
On the preferred extensions of argumentation frameworks: bijections with naive sets
This paper deals with the problem of finding the preferred extensions of an argumentation framework by means of a bijection with the naive sets of another framework. First, we consider the case where an argumentation fra…
Technical report of "Empirical Study on Human Evaluation of Complex Argumentation Frameworks"
In abstract argumentation, multiple argumentation semantics have been proposed that allow to select sets of jointly acceptable arguments from a given argumentation framework, i.e. based only on the attack relation betwee…
Abstract ArgumentationRelationOn Gradual Semantics for Assumption-Based Argumentation
In computational argumentation, gradual semantics are fine-grained alternatives to extension-based and labelling-based semantics . They ascribe a dialectical strength to (components of) arguments sanctioning their degree…
A Preliminary Report on Probabilistic Attack Normal Form for Constellation Semantics
After Dung's founding work in Abstract Argumentation Frameworks there has been a growing interest in extending the Dung's semantics in order to describe more complex or real life situations. Several of these approaches t…
Abstract ArgumentationForm