Extending abstract argumentation systems theory

摘要

In this paper, we extend the theory of abstract argumentation systems proposed by Vreeswijk (1997). This framework stands at a high abstraction level and provides a general model for argumentation activity. However, the theory reveals an inherent limitation in that the premises of the argumentation process are assumed to be indefeasible, and this introduces the need of an implicit constraint on the strength of the arguments, in order to preserve correctness. In many application contexts the information available to start reasoning is not guaranteed to be completely reliable, therefore it is natural to assume that premises can be discarded during the argumentation process. We extend the theory by admitting that premises can be defeated and relaxing the implicit assumption about their strength.