In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung’s abstract argumentation frameworks. We distinguish three kinds of decision problems for argumentation verification, called extension verification, framework verification, and specification verification respectively. For example, given a political requirement like “if the argument to increase taxes is accepted, then the argument to increase services must be accepted too,” we can either verify an extension of acceptable arguments, or all extensions of an argumentation framework, or all extensions of all argumentation frameworks satisfying a framework specification. We introduce the logic of argumentation verification to specify such requirements, and we represent the three verification problems of argumentation as model checking and theorem proving properties of the logic. Moreover, we recast the logic of argumentation verification in a modal framework, in order to express multiple extensions, and properties like transitivity and reflexivity of the attack relation. Finally, we introduce a logic of meta-argumentation where abstract argumentation is used to reason about abstract argumentation itself. We define the logic of meta-argumentation using the fibring methodology in such a way to represent attack relations not only among arguments but also among attacks.
展开▼
机译:在端对端激活f 1 Sub>(00)的“ k”个“最小化区域”结果参数 +1 Sup> m k Sub>中生成的方法 min Sub>→ +1 Sup> m k Sub>用于根据三元数系统的f(+ 1,0,-1)结构的算术公理进行转换模拟信号的参数“«-/ +»[m j Sub>] f(+/-)--”互补代码“转换为条件最小化位置信号的结构模拟信号±< / Sup> [m j Sub>] f усл Sub>(+/-) min Sub>及其实现的功能结构(俄罗斯逻辑版本)