Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation
In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with respect to a class of gradual semantics, through the verification of graded (strict or defeasible) implications over a preferential interpretation. As a proof of concept, in the finitely-valued case, an Answer set Programming approach is proposed for conditional reasoning in a many-valued argumentation semantics of weighted argumentation graphs. The paper also develops and discusses a probabilistic semantics for gradual argumentation, which builds on the many-valued conditional semantics.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
From Weighted Conditionals of Multilayer Perceptrons to Gradual Argumentation and Back
A fuzzy multipreference semantics has been recently proposed for weighted conditional knowledge bases, and used to develop a logical semantics for Multilayer Perceptrons, by regarding a deep neural network (after trainin…
Towards Ranking-based Semantics for Abstract Argumentation using Conditional Logic Semantics
We propose a novel ranking-based semantics for Dung-style argumentation frameworks with the help of conditional logics. Using an intuitive translation for an argumentation framework to generate conditionals, we can apply…
Abstract ArgumentationTranslationsmProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation
Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide m…
Range-based argumentation semantics as 2-valued models
Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are lo…
Translating Recursive Probabilistic Programs to Factor Graph Grammars
It is natural for probabilistic programs to use conditionals to express alternative substructures in models, and loops (recursion) to express repeated substructures in models. Thus, probabilistic programs with conditiona…
Translation