Possibilistic-Based Argumentation: An Answer Set Programming Approach

In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments could support conclusions. We present a possibilistic-based argumentation approach which is based on a possibilistic disjunctive language. This specification language is able to capture incomplete information and incomplete states of a knowledge base at the same time.