Abstract Weighted Based Gradual Semantics in Argumentation Theory

• URL: http://arxiv.org/abs/2401.11472v3
• Date: Tue, 20 Aug 2024 12:44:00 GMT
• Title: Abstract Weighted Based Gradual Semantics in Argumentation Theory
• Authors: Assaf Libman, Nir Oren, Bruno Yun,
• Abstract summary: We introduce four important problems linking gradual semantics and acceptability degrees. First, we reexamine the inverse problem, seeking to identify the argument weights of the argumentation framework which lead to a specific final acceptability degree. Third, we ask whether argument weights can be found when preferences, rather than acceptability degrees for arguments are considered. Fourth, we consider the topology of the space of valid acceptability degrees, asking whether "gaps" exist in this space.
• Score: 3.2566808526538873
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Weighted gradual semantics provide an acceptability degree to each argument representing the strength of the argument, computed based on factors including background evidence for the argument, and taking into account interactions between this argument and others. We introduce four important problems linking gradual semantics and acceptability degrees. First, we reexamine the inverse problem, seeking to identify the argument weights of the argumentation framework which lead to a specific final acceptability degree. Second, we ask whether the function mapping between argument weights and acceptability degrees is injective or a homeomorphism onto its image. Third, we ask whether argument weights can be found when preferences, rather than acceptability degrees for arguments are considered. Fourth, we consider the topology of the space of valid acceptability degrees, asking whether "gaps" exist in this space. While different gradual semantics have been proposed in the literature, in this paper, we identify a large family of weighted gradual semantics, called abstract weighted based gradual semantics. These generalise many of the existing semantics while maintaining desirable properties such as convergence to a unique fixed point. We also show that a sub-family of the weighted gradual semantics, called abstract weighted (L^p,\lambda,\mu)-based gradual semantics and which include well-known semantics, solve all four of the aforementioned problems.

Related papers

• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• Inferring Attack Relations for Gradual Semantics [5.254093731341154]
  A gradual semantics takes a weighted argumentation framework as input and outputs a final acceptability degree for each argument. We seek to determine whether there is a set of attacks on those arguments such that we can obtain these acceptability degrees.
  arXiv  Detail & Related papers  (2022-11-29T11:45:27Z)
• Fuzzy Labeling Semantics for Quantitative Argumentation [0.0]
  We provide a novel quantitative method called fuzzy labeling for fuzzy argumentation systems. A triple of acceptability, rejectability, and undecidability degrees is used to evaluate argument strength.
  arXiv  Detail & Related papers  (2022-07-15T08:31:36Z)
• Admissibility in Strength-based Argumentation: Complexity and Algorithms (Extended Version with Proofs) [1.5828697880068698]
  We study the adaptation of admissibility-based semantics to Strength-based Argumentation Frameworks (StrAFs) Especially, we show that the strong admissibility defined in the literature does not satisfy a desirable property, namely Dung's fundamental lemma. We propose a translation in pseudo-Boolean constraints for computing (strong and weak) extensions.
  arXiv  Detail & Related papers  (2022-07-05T18:42:04Z)
• Analytical Solutions for the Inverse Problem within Gradual Semantics [3.957174470017176]
  We show how an analytical approach can be used to solve the inverse problem in gradual semantics. Unlike the current state-of-the-art, such an approach can rapidly find a solution, and is guaranteed to do so.
  arXiv  Detail & Related papers  (2022-03-02T15:55:10Z)
• The Inverse Problem for Argumentation Gradual Semantics [8.860629791560198]
  A sub-class of such semantics, the so-called weighted semantics, takes an initial set of weights over the arguments as input. We consider the inverse problem over such weighted semantics. That is, given an argumentation framework and a desired argument ranking, we ask whether there exist initial weights such that a particular semantics produces the given ranking.
  arXiv  Detail & Related papers  (2022-02-01T09:46:23Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Topology of Word Embeddings: Singularities Reflect Polysemy [68.8204255655161]
  We introduce a topological measure of polysemy based on persistent homology that correlates well with the actual number of meanings of a word. We propose a simple, topologically motivated solution to the SemEval-2010 task on Word Sense Induction & Disambiguation.
  arXiv  Detail & Related papers  (2020-11-18T17:21:51Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)
• Human Correspondence Consensus for 3D Object Semantic Understanding [56.34297279246823]
  In this paper, we introduce a new dataset named CorresPondenceNet. Based on this dataset, we are able to learn dense semantic embeddings with a novel geodesic consistency loss. We show that CorresPondenceNet could not only boost fine-grained understanding of heterogeneous objects but also cross-object registration and partial object matching.
  arXiv  Detail & Related papers  (2019-12-29T04:24:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.