Beyond Maxi-Consistent Argumentation Operators
The question whether Dung’s abstract argumentation theory can be instantiated with classical propositional logic has drawn a considerable amount of attention among scientists in recent years. It was shown by Cayrol in 1995 that if direct undercut is used, then stable extensions of an argumentation system correspond exactly to maximal (for set inclusion) consistent subsets of the knowledge base from which the argumentation system was constructed. Until now, no other correspondences were found between the extensions of an argumentation framework and its knowledge base (except if preferences are also given at the input of the system). This paper’s contribution is twofold. First, we identify four intuitive conditions describing a class of attack relations which return extensions corresponding exactly to the maximal (for set inclusion) consistent subsets of the knowledge base. Second, we show that if we relax those conditions, it is possible to instantiate Dung’s abstract argumentation theory with classical propositional logic and obtain a meaningful result which does not correspond to the maximal consistent subsets of the knowledge base used for constructing arguments. Indeed, we define a whole class of instantiations that return different results. Furthermore, we show that these instantiations are sound in the sense that they satisfy the postulates from argumentation literature (e.g. consistency, closure). In order to illustrate our results, we present one particular instantiation from this class, which is based on cardinalities of minimal inconsistent sets a formula belongs to.
KeywordsArgumentation Framework Inference Relation Classical Propositional Logic Argumentation System Attack Relation
Unable to display preview. Download preview PDF.
- 2.Amgoud, L., Vesic, S.: A new approach for preference-based argumentation frameworks. Annals of Mathematics and Artificial Intelligence (2011)Google Scholar
- 6.Cayrol, C.: On the relation between argumentation and non-monotonic coherence-based entailment. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 1443–1448 (1995)Google Scholar
- 8.Gabbay, D., Pigozzi, G., Rodrigues, O.: Common foundations for belief revision, belief merging and voting. In: Formal Models of Belief Change in Rational Agents (Dagstuhl Seminar Proceedings) (2007)Google Scholar
- 12.Shapley, L.: A value for n-person games. In: Contributions to the Theory of Games II, pp. 307–317. Princeton University Press (1953)Google Scholar