The Analysis Of The Argumentation Framework With Subargument

Currently,most abstract argumentation systems restrict the relationship between the arguments to the attack relationship.However,in daily life,it is not enough to f’ocus on the attack relationship between arguments.The ability of expression of abstract argumentation framework is limited and it is easy to be inconsistent with reality when dealing with dynamic problems.On the other hand,as for the abstract argumentation framework,only the topological structure of the attack between the arguments can be used to calculate the semantics,and there is no way to improve the computational efficiency further.In order to deal with these problems,this paper first defines the subargument relationship on the basis of previous theories,and then carries on two aspects of analysis on the argumentation framework with subargument(AFwS).Firstly,from the perspective of structured argumentation theory,the AFwS is different from the abstract argumentation framework.There is no support relation between arguments in the abstract argumentation framework.Therefore,adding arguments or deleting arguments is arbitrary when making changes to the framework.However,when a subargument relation is added to the framework,the activity of the argument depends on its subargument.It is argued that if a subargument of an argument is deleted,then this argument will lose its activity.Therefore,more constraints must be taken into account when changing the argumentation framework with subargument.Secondly,this paper focuses on the calculation of argumentation semantics from perspective.Since arguments whose status can be indirectly determined by their proper subarguments as well as those arguments that are unrelated to any attacks may not be involved in the process of status evaluation of arguments.BeiShui Liao proposes a layered AFuwS(LAFwS)in which arguments are classfied into confict-handling arguments and status-dependent arguments,such that the conficts among arguments are handled centrally.Based on the layered theory,the writer designs an algorithms to compare the layered theory and the traditional theory(using the topology of attack relation)and then implement the algorithms in JAVA language.The experimental data showed that the layered method is more efficient than the traditional method.