This paper introduces a novel parametric family of semantics for abstractargumentation called resolution-based and analyzes in particular the resolution-based version of the traditional grounded semantics, showing th...
详细信息
This paper introduces a novel parametric family of semantics for abstractargumentation called resolution-based and analyzes in particular the resolution-based version of the traditional grounded semantics, showing that it features the unique property of satisfying a set of general desirable properties recently introduced in the literature. Additionally, an investigation of its computational complexity properties reveals that resolution-based grounded semantics is satisfactory also from this perspective. (C) 2010 Elsevier B.V. All rights reserved.
In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated a...
详细信息
In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to serve as a basis for describing various equivalences between logic programming semantics and argumentationsemantics. In particular, we are able to show equivalence between regular semantics for logic programming and preferred semantics for formal argumentation. We also show that there exist logic programming semantics (L-stable semantics) that cannot be captured by any abstract argumentation semantics. (C) 2014 Elsevier Inc. All rights reserved.
Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting eac...
详细信息
Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting each stable model with the relevant atoms. The given mapping function is of polynomial size w.r.t. AF. In particular, we identify that there is a direct relationship between the minimal models of a propositional formula and the preferred extensions of an argumentation framework by working on representing the defeated arguments. Then we show how to infer the preferred extensions of an argumentation framework by using UNSAT algorithms and disjunctive stable model solvers. The relevance of this result is that we define a direct relationship between one of the most satisfactory argumentationsemantics and one of the most successful approach of nonmonotonic reasoning i.e., logic programming with the stable model semantics.
In Dung's abstractargumentation theory, an extension can be represented by subsets of it in the sense that from each of these subsets, the extension can be obtained again by iteratively applying the characteristi...
详细信息
ISBN:
(纸本)9781614999065;9781614999058
In Dung's abstractargumentation theory, an extension can be represented by subsets of it in the sense that from each of these subsets, the extension can be obtained again by iteratively applying the characteristic function. Such so-called regular representations can be used to differentiate argumentation frameworks having the same extensions. In this paper we provide a full characterization of relations between seven different types of representation equivalence.
In Dung's abstractsemantics, the label undecided is always propagated from the attacker to the attacked argument, unless the latter is also attacked by an accepted argument. In this work we propose undecidedness ...
详细信息
In Dung's abstractsemantics, the label undecided is always propagated from the attacker to the attacked argument, unless the latter is also attacked by an accepted argument. In this work we propose undecidedness blocking abstract argumentation semantics where the undecided label is confined to the strong connected component where it was generated and it is not propagated to the other parts of the argumentation graph. We show how undecidedness blocking is a fundamental reasoning pattern absent in abstractargumentation but present in similar fashion in the ambiguity blocking semantics of Defeasible logic, in the beyond reasonable doubt legal principle or when someone gives someone else the benefit of the doubt. The resulting semantics, called SCC-void semantics, are defined using an SCC-recursive schema. The semantics are conflict-free and non-admissible, but they incorporate a more relaxed defence-based notion of admissibility. They allow reinstatement and they credulously accept what the corresponding Dung's complete semantics accepts at least credulously.
We propose a set of novel ranking-based semantics based on a measure of the sensitivity of each argument in an abstractargumentation framework. The sensitivity index is an indicator of how sensitive the label assigne...
详细信息
We propose a set of novel ranking-based semantics based on a measure of the sensitivity of each argument in an abstractargumentation framework. The sensitivity index is an indicator of how sensitive the label assigned to an argument by an argumentationsemantics is, and it is derived from the topology of the graph via a subgraphs analysis coupled with the postulates of the chosen semantics. Using the total rank on arguments induced by such indicator, we propose two ranking-based semantics. We compare the behaviour of our semantics with recent proposals and a widespread set of properties identified in literature. A key feature of our semantics is that the attack relation between arguments keeps the same meaning as found in Dung's abstractsemantics. By still relying on Dung's semantics we can soundly deal with any graph configuration, minimize the addition of ad-hoc postulates and provide a clear interpretation of the ranking of arguments.
暂无评论