![]() ; ; Gabbay, Dov M. ![]() in International Journal of Approximate Reasoning (2022), 140 In the symbolic artificial intelligence community, abstract argumentation with its semantics, i.e. approaches for defining sets of valid conclusions (extensions) that can be derived from argumentation ... [more ▼] In the symbolic artificial intelligence community, abstract argumentation with its semantics, i.e. approaches for defining sets of valid conclusions (extensions) that can be derived from argumentation graphs, is considered a promising method for non-monotonic reasoning. However, from a sequential perspective, abstract argumentation-based decision-making processes typically do not guarantee an alignment with common formal notions to assess consistency; in particular, abstract argumentation can, in itself, not enforce the satisfaction of relational principles such as reference independence (based on a key principle of microeconomic theory) and cautious monotony. In this paper, we address this issue by introducing different approaches to ensuring reference independence and cautious monotony in sequential argumentation: a reductionist, an expansionist, and an extension-selecting approach. The first two approaches are generically applicable, but may require comprehensive changes to the corresponding argumentation framework. In contrast, the latter approach guarantees that an extension of the corresponding argumentation framework can be selected to satisfy the relational principle by requiring that the used argumentation semantics is weakly reference independent or weakly cautiously monotonous, respectively, and also satisfies some additional straightforward principles. To highlight the relevance of the approach, we illustrate how the extension-selecting approach to reference independent argumentation can be applied to model (boundedly) rational economic decision-making. [less ▲] Detailed reference viewed: 25 (1 UL)![]() ; ; Gabbay, Dov M. ![]() in International Journal of Approximate Reasoning (2013), 54(4), 541--559 Detailed reference viewed: 117 (4 UL)![]() Ryan, Peter ![]() in International Journal of Approximate Reasoning (2013), 54(1), 228-251 This paper develops a new uncertainty measure for the theory of hints that complies with the established semantics of statistical information theory and further satisfies all classical requirements for ... [more ▼] This paper develops a new uncertainty measure for the theory of hints that complies with the established semantics of statistical information theory and further satisfies all classical requirements for such a measure imposed in the literature. The proposed functional decomposes into conversant uncertainty measures and therefore discloses a new interpretation of the latters as well. By abstracting to equivalence classes of hints we transport the new measure to mass functions in Dempster-Shafer theory and analyse its relationship with the aggregate uncertainty, which currently is the only known functional for the Dempster-Shafer theory of evidence that satisfies the same set of properties. Moreover, the perspective of hints reveals that the standard independence notion in Dempster-Shafer theory called non-interactivity corresponds to an amalgamation of probabilistic independence and qualitative independence between frames of discernment. All results in this paper are developed for arbitrary families of compatible frames generalizing the very specialized multi-variate systems that are usually studied in information theory. [less ▲] Detailed reference viewed: 147 (2 UL)![]() ; van der Torre, Leon ![]() in International Journal of Approximate Reasoning (2008), 48(3), 730751 In preference-based argumentation theory, an argument may be preferred to another one when, for example, it is more specific, its beliefs have a higher probability or certainty, or it promotes a higher ... [more ▼] In preference-based argumentation theory, an argument may be preferred to another one when, for example, it is more specific, its beliefs have a higher probability or certainty, or it promotes a higher value. In this paper we generalize Bench-Capon’s value-based argumentation theory such that arguments can promote multiple values, and preferences among values or arguments can be specified in various ways. We assume in addition that there is default knowledge about the preferences over the arguments, and we use an algorithm to derive the most likely preference order. In particular, we show how to use non-monotonic preference reasoning to compute preferences among arguments, and subsequently the acceptable arguments, from preferences among values. We show also how the preference ordering can be used to optimize the algorithm to construct the grounded extension by proceeding from most to least preferred arguments. [less ▲] Detailed reference viewed: 125 (1 UL) |
||