Expressiveness of SETAFs and Support-Free ADFs under 3-valued Semantics

• URL: http://arxiv.org/abs/2007.03581v1
• Date: Tue, 7 Jul 2020 16:03:23 GMT
• Title: Expressiveness of SETAFs and Support-Free ADFs under 3-valued Semantics
• Authors: Wolfgang Dvo\v{r}\'ak and Atefeh Keshavarzi Zafarghandi and Stefan Woltran
• Abstract summary: We shed light on the relation between SETAFs and support-free ADFs. It is only the presence of unsatisfiable acceptance conditions in support-free ADFs that discriminate the two approaches.
• Score: 15.174903837196297
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generalizing the attack structure in argumentation frameworks (AFs) has been studied in different ways. Most prominently, the binary attack relation of Dung frameworks has been extended to the notion of collective attacks. The resulting formalism is often termed SETAFs. Another approach is provided via abstract dialectical frameworks (ADFs), where acceptance conditions specify the relation between arguments; restricting these conditions naturally allows for so-called support-free ADFs. The aim of the paper is to shed light on the relation between these two different approaches. To this end, we investigate and compare the expressiveness of SETAFs and support-free ADFs under the lens of 3-valued semantics. Our results show that it is only the presence of unsatisfiable acceptance conditions in support-free ADFs that discriminate the two approaches.

Related papers

• Cyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mapping [19.799266797193344]
  We present classical semantics for the Bipolar Argumentation Framework (BAF) and the Recursive BAF (Rec-BAF) This is achieved by providing a modular definition of the sets of defeated and acceptable elements for each BAF-based framework. We also characterize, in an elegant and uniform way, the semantics of general BAF and Rec-BAF in terms of logic programming and partial stable model semantics.
  arXiv  Detail & Related papers  (2024-08-14T16:06:16Z)
• LEAF: Unveiling Two Sides of the Same Coin in Semi-supervised Facial Expression Recognition [56.22672276092373]
  Semi-supervised learning has emerged as a promising approach to tackle the challenge of label scarcity in facial expression recognition. We propose a unified framework termed hierarchicaL dEcoupling And Fusing to coordinate expression-relevant representations and pseudo-labels. We show that LEAF outperforms state-of-the-art semi-supervised FER methods, effectively leveraging both labeled and unlabeled data.
  arXiv  Detail & Related papers  (2024-04-23T13:43:33Z)
• Variance-Preserving-Based Interpolation Diffusion Models for Speech Enhancement [53.2171981279647]
  We present a framework that encapsulates both the VP- and variance-exploding (VE)-based diffusion methods. To improve performance and ease model training, we analyze the common difficulties encountered in diffusion models. We evaluate our model against several methods using a public benchmark to showcase the effectiveness of our approach.
  arXiv  Detail & Related papers  (2023-06-14T14:22:22Z)
• Non-flat ABA is an Instance of Bipolar Argumentation [23.655909692988637]
  Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism. A common restriction imposed on ABA frameworks (ABAFs) is that they are flat. No translation exists from general, possibly non-flat ABAFs into any kind of abstract argumentation formalism.
  arXiv  Detail & Related papers  (2023-05-21T13:18:08Z)
• 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)
• Document-Level Relation Extraction with Sentences Importance Estimation and Focusing [52.069206266557266]
  Document-level relation extraction (DocRE) aims to determine the relation between two entities from a document of multiple sentences. We propose a Sentence Estimation and Focusing (SIEF) framework for DocRE, where we design a sentence importance score and a sentence focusing loss. Experimental results on two domains show that our SIEF not only improves overall performance, but also makes DocRE models more robust.
  arXiv  Detail & Related papers  (2022-04-27T03:20:07Z)
• Dive into Ambiguity: Latent Distribution Mining and Pairwise Uncertainty Estimation for Facial Expression Recognition [59.52434325897716]
  We propose a solution, named DMUE, to address the problem of annotation ambiguity from two perspectives. For the former, an auxiliary multi-branch learning framework is introduced to better mine and describe the latent distribution in the label space. For the latter, the pairwise relationship of semantic feature between instances are fully exploited to estimate the ambiguity extent in the instance space.
  arXiv  Detail & Related papers  (2021-04-01T03:21:57Z)
• Inter-class Discrepancy Alignment for Face Recognition [55.578063356210144]
  We propose a unified framework calledInter-class DiscrepancyAlignment(IDA) IDA-DAO is used to align the similarity scores considering the discrepancy between the images and its neighbors. IDA-SSE can provide convincing inter-class neighbors by introducing virtual candidate images generated with GAN.
  arXiv  Detail & Related papers  (2021-03-02T08:20:08Z)
• Strong Admissibility for Abstract Dialectical Frameworks [0.0]
  We present the concept of strong admissibility of interpretations for ADFs. We show that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as top element.
  arXiv  Detail & Related papers  (2020-12-10T21:50:35Z)
• Opinion Transmission Network for Jointly Improving Aspect-oriented Opinion Words Extraction and Sentiment Classification [56.893393134328996]
  Aspect-level sentiment classification (ALSC) and aspect oriented opinion words extraction (AOWE) are two highly relevant aspect-based sentiment analysis subtasks. We propose a novel joint model, Opinion Transmission Network (OTN), to exploit the potential bridge between ALSC and AOWE.
  arXiv  Detail & Related papers  (2020-11-01T11:00:19Z)
• Abstract Interpretation in Formal Argumentation: with a Galois Connection for Abstract Dialectical Frameworks and May-Must Argumentation (First Report) [3.7311680121118336]
  Labelling-based formal argumentation relies on labelling functions that typically assign one of 3 labels to indicate either acceptance, rejection, or else undecided-to-be-either. Abstract dialectical frameworks (ADF) is a well-known argumentation formalism that belongs to this category. We prove that there is a Galois connection between MMA and ADF, in which is a concretisation of MMA and MMA is an abstraction of ADF.
  arXiv  Detail & Related papers  (2020-07-22T04:26:15Z)

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.