On SCC-recursiveness in Quantitative Argumentation

• URL: http://arxiv.org/abs/2006.08880v2
• Date: Mon, 28 Oct 2024 13:27:29 GMT
• Title: On SCC-recursiveness in Quantitative Argumentation
• Authors: Zongshun Wang, Yuping Shen,
• Abstract summary: We show that SCC-recursiveness is well-suited to fuzzy extension semantics. We show that SCC-recursiveness provides an alternative approach to characterize fuzzy extension semantics.
• Score: 0.0
• License:
• Abstract: Abstract argumentation is a reasoning model for evaluating arguments based on various semantics. SCC-recursiveness is a sophisticated property of semantics that provides a general schema for characterizing semantics through the decomposition along strongly connected components (SCCs). While this property has been extensively explored in various qualitative frameworks, it has been relatively neglected in quantitative argumentation. To fill this gap, we demonstrate that this property is well-suited to fuzzy extension semantics, which is a quantitative generalization of classical semantics in fuzzy argumentation frameworks (FAF). We tailor the SCC-recursive schema to enable the characterization of fuzzy extension semantics through the recursive decomposition of an FAF along its SCCs. Our contributions are twofold. Theoretically, we show that SCC-recursiveness provides an alternative approach to characterize fuzzy extension semantics, offering a deep understanding and better insight into these semantics. Practically, our schema provides a sound and complete algorithm for computing fuzzy extension semantics, which naturally reduces computational efforts when dealing with a large number of SCCs.

Related papers

• A Methodology for Gradual Semantics for Structured Argumentation under Incomplete Information [15.717458041314194]
  We provide a novel methodology for obtaining gradual semantics for structured argumentation frameworks. Our methodology accommodates incomplete information about arguments' premises. We demonstrate the potential of our approach by introducing two different instantiations of the methodology.
  arXiv  Detail & Related papers  (2024-10-29T16:38:35Z)
• Spatial Semantic Recurrent Mining for Referring Image Segmentation [63.34997546393106]
  We propose Stextsuperscript2RM to achieve high-quality cross-modality fusion. It follows a working strategy of trilogy: distributing language feature, spatial semantic recurrent coparsing, and parsed-semantic balancing. Our proposed method performs favorably against other state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-05-15T00:17:48Z)
• Open-Vocabulary Segmentation with Semantic-Assisted Calibration [73.39366775301382]
  We study open-vocabulary segmentation (OVS) through calibrating in-vocabulary and domain-biased embedding space with contextual prior of CLIP. We present a Semantic-assisted CAlibration Network (SCAN) to achieve state-of-the-art performance on open-vocabulary segmentation benchmarks.
  arXiv  Detail & Related papers  (2023-12-07T07:00:09Z)
• Ranking-based Argumentation Semantics Applied to Logical Argumentation (full version) [2.9005223064604078]
  We investigate the behaviour of ranking-based semantics for structured argumentation. We show that a wide class of ranking-based semantics gives rise to so-called culpability measures.
  arXiv  Detail & Related papers  (2023-07-31T15:44:33Z)
• 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)
• 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)
• Rediscovering Argumentation Principles Utilizing Collective Attacks [26.186171927678874]
  We extend the principle-based approach to Argumentation Frameworks with Collective Attacks (SETAFs) Our analysis shows that investigating principles based on decomposing the given SETAF (e.g. directionality or SCC-recursiveness) poses additional challenges in comparison to usual AFs.
  arXiv  Detail & Related papers  (2022-05-06T11:41:23Z)
• Anti-aliasing Semantic Reconstruction for Few-Shot Semantic Segmentation [66.85202434812942]
  We reformulate few-shot segmentation as a semantic reconstruction problem. We convert base class features into a series of basis vectors which span a class-level semantic space for novel class reconstruction. Our proposed approach, referred to as anti-aliasing semantic reconstruction (ASR), provides a systematic yet interpretable solution for few-shot learning problems.
  arXiv  Detail & Related papers  (2021-06-01T02:17:36Z)
• Deep Clustering by Semantic Contrastive Learning [67.28140787010447]
  We introduce a novel variant called Semantic Contrastive Learning (SCL) It explores the characteristics of both conventional contrastive learning and deep clustering. It can amplify the strengths of contrastive learning and deep clustering in a unified approach.
  arXiv  Detail & Related papers  (2021-03-03T20:20:48Z)
• On graded semantics of abstract argumentation: Extension-based case [0.0]
  This paper considers some issues on extension-based semantics for abstract argumentation framework (AAF) An alternative fundamental lemma is given, which generalizes the corresponding result obtained in [1]. A number of fundamental semantics for AAF, including conflict-free, admissible, complete and stable semantics, are shown to be closed under reduced meet modulo an ultrafilter.
  arXiv  Detail & Related papers  (2020-12-19T04:32:19Z)
• Closed-Form Factorization of Latent Semantics in GANs [65.42778970898534]
  A rich set of interpretable dimensions has been shown to emerge in the latent space of the Generative Adversarial Networks (GANs) trained for synthesizing images. In this work, we examine the internal representation learned by GANs to reveal the underlying variation factors in an unsupervised manner. We propose a closed-form factorization algorithm for latent semantic discovery by directly decomposing the pre-trained weights.
  arXiv  Detail & Related papers  (2020-07-13T18:05:36Z)

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.