A matrix approach for computing extensions of argumentation frameworks

摘要: The matrices and their sub-blocks are introduced into the study of determining various extensions in sense Dung's theory argumentation frameworks. It is showed that each framework has its matrix representations, core semantics defined by Dung can be characterized specific matrix. Furthermore, elementary permutations a employed which an efficient approach for finding out all under given obtained. Different from several established approaches, such as graph labelling algorithm, Constraint Satisfaction Problem not only put mathematic idea investigation extensions, but also completely achieve goal to compute needed.