The Inverse Problem for Argumentation Gradual Semantics
- URL: http://arxiv.org/abs/2202.00294v1
- Date: Tue, 1 Feb 2022 09:46:23 GMT
- Title: The Inverse Problem for Argumentation Gradual Semantics
- Authors: Nir Oren and Bruno Yun and Srdjan Vesic and Murilo Baptista
- Abstract summary: 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.
- Score: 8.860629791560198
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Gradual semantics with abstract argumentation provide each argument with a
score reflecting its acceptability, i.e. how "much" it is attacked by other
arguments. Many different gradual semantics have been proposed in the
literature, each following different principles and producing different
argument rankings. A sub-class of such semantics, the so-called weighted
semantics, takes, in addition to the graph structure, an initial set of weights
over the arguments as input, with these weights affecting the resultant
argument ranking. In this work, 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. The contribution of this paper
are: (1) an algorithm to answer this problem, (2) a characterisation of the
properties that a gradual semantics must satisfy for the algorithm to operate,
and (3) an empirical evaluation of the proposed algorithm.
Related papers
- H-STAR: LLM-driven Hybrid SQL-Text Adaptive Reasoning on Tables [56.73919743039263]
This paper introduces a novel algorithm that integrates both symbolic and semantic (textual) approaches in a two-stage process to address limitations.
Our experiments demonstrate that H-STAR significantly outperforms state-of-the-art methods across three question-answering (QA) and fact-verification datasets.
arXiv Detail & Related papers (2024-06-29T21:24:19Z) - Abstract Weighted Based Gradual Semantics in Argumentation Theory [3.2566808526538873]
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.
arXiv Detail & Related papers (2024-01-21T12:22:48Z) - A Unifying Framework for Learning Argumentation Semantics [50.69905074548764]
We present a novel framework, which uses an Inductive Logic Programming approach to learn the acceptability semantics for several abstract and structured argumentation frameworks in an interpretable way.
Our framework outperforms existing argumentation solvers, thus opening up new future research directions in the area of formal argumentation and human-machine dialogues.
arXiv Detail & Related papers (2023-10-18T20:18:05Z) - 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) - Many-valued Argumentation, Conditionals and a Probabilistic Semantics
for Gradual Argumentation [3.9571744700171743]
We propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics.
As a proof of concept, in the finitely-valued case, an Answer set Programming approach is proposed for conditional reasoning.
The paper also develops and discusses a probabilistic semantics for gradual argumentation, which builds on the many-valued conditional semantics.
arXiv Detail & Related papers (2022-12-14T22:10:46Z) - 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) - Semantic-Preserving Adversarial Text Attacks [85.32186121859321]
We propose a Bigram and Unigram based adaptive Semantic Preservation Optimization (BU-SPO) method to examine the vulnerability of deep models.
Our method achieves the highest attack success rates and semantics rates by changing the smallest number of words compared with existing methods.
arXiv Detail & Related papers (2021-08-23T09:05:18Z) - Abstract Reasoning via Logic-guided Generation [65.92805601327649]
Abstract reasoning, i.e., inferring complicated patterns from given observations, is a central building block of artificial general intelligence.
This paper aims to design a framework for the latter approach and bridge the gap between artificial and human intelligence.
We propose logic-guided generation (LoGe), a novel generative DNN framework that reduces abstract reasoning as an optimization problem in propositional logic.
arXiv Detail & Related papers (2021-07-22T07:28:24Z) - Adversarial Semantic Collisions [129.55896108684433]
We study semantic collisions: texts that are semantically unrelated but judged as similar by NLP models.
We develop gradient-based approaches for generating semantic collisions.
We show how to generate semantic collisions that evade perplexity-based filtering.
arXiv Detail & Related papers (2020-11-09T20:42:01Z) - 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.