At a high level of abstraction, many systems of argumentation can be represented by a set of abstract arguments, and a binary relation between these abstract arguments describing how they contradict each other. Acceptable sets of arguments, called extensions, can be defined as sets of arguments that do not contradict one another, and attack all their attackers. We are interested in this paper in answering the question: is a given argument in all extensions of an argumentation system? In fact, what is likely to be useful in AI systems is not a simple yes/no answer, but some kind of well-argued answer, called a proof: if an argument is in every extension, why is it so? Several authors have described proofs that explain why a given argument is in at least one extension. In this paper, we show that a proof that an argument is in every extension can be a proof that some meta-argument is in at least one extension of a meta-argumentation system: this meta-argumentation system describes relationships between sets of arguments of the initial system.
CITATION STYLE
Doutre, S., & Mengin, J. (2004). On sceptical versus credulous acceptance for abstract argument systems. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3229, pp. 462–473). Springer Verlag. https://doi.org/10.1007/978-3-540-30227-8_39
Mendeley helps you to discover research relevant for your work.