Relational Argumentation Semantics
- URL: http://arxiv.org/abs/2104.12386v1
- Date: Mon, 26 Apr 2021 07:58:17 GMT
- Title: Relational Argumentation Semantics
- Authors: Ryuta Arisaka, Takayuki Ito
- Abstract summary: We show that many existing semantics such as explanation semantics, multi-agent semantics, and more typical semantics, are understood in the relational perspective.
This is a direction to understand argumentation semantics through a common formal language.
- Score: 10.165529175855712
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we propose a fresh perspective on argumentation semantics, to
view them as a relational database. It offers encapsulation of the underlying
argumentation graph, and allows us to understand argumentation semantics under
a single, relational perspective, leading to the concept of relational
argumentation semantics. This is a direction to understand argumentation
semantics through a common formal language. We show that many existing
semantics such as explanation semantics, multi-agent semantics, and more
typical semantics, that have been proposed for specific purposes, are
understood in the relational perspective.
Related papers
- Learning Visual-Semantic Subspace Representations for Propositional Reasoning [49.17165360280794]
We propose a novel approach for learning visual representations that conform to a specified semantic structure.
Our approach is based on a new nuclear norm-based loss.
We show that its minimum encodes the spectral geometry of the semantics in a subspace lattice.
arXiv Detail & Related papers (2024-05-25T12:51:38Z) - A Note on an Inferentialist Approach to Resource Semantics [48.65926948745294]
'Inferentialism' is the view that meaning is given in terms of inferential behaviour.
This paper shows how 'inferentialism' enables a versatile and expressive framework for resource semantics.
arXiv Detail & Related papers (2024-05-10T14:13:21Z) - 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) - 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) - Natural Language Decompositions of Implicit Content Enable Better Text
Representations [56.85319224208865]
We introduce a method for the analysis of text that takes implicitly communicated content explicitly into account.
We use a large language model to produce sets of propositions that are inferentially related to the text that has been observed.
Our results suggest that modeling the meanings behind observed language, rather than the literal text alone, is a valuable direction for NLP.
arXiv Detail & Related papers (2023-05-23T23:45:20Z) - 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) - Imitation Learning-based Implicit Semantic-aware Communication Networks:
Multi-layer Representation and Collaborative Reasoning [68.63380306259742]
Despite its promising potential, semantic communications and semantic-aware networking are still at their infancy.
We propose a novel reasoning-based implicit semantic-aware communication network architecture that allows multiple tiers of CDC and edge servers to collaborate.
We introduce a new multi-layer representation of semantic information taking into consideration both the hierarchical structure of implicit semantics as well as the personalized inference preference of individual users.
arXiv Detail & Related papers (2022-10-28T13:26:08Z) - Visual Superordinate Abstraction for Robust Concept Learning [80.15940996821541]
Concept learning constructs visual representations that are connected to linguistic semantics.
We ascribe the bottleneck to a failure of exploring the intrinsic semantic hierarchy of visual concepts.
We propose a visual superordinate abstraction framework for explicitly modeling semantic-aware visual subspaces.
arXiv Detail & Related papers (2022-05-28T14:27:38Z) - 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) - On a plausible concept-wise multipreference semantics and its relations
with self-organising maps [0.0]
We argue that this proposal satisfies some desired properties, such as KLM, and avoids the drowning problem.
We motivate the plausibility of the concept-wise multi-preference semantics by developing a logical semantics of self-organising maps.
arXiv Detail & Related papers (2020-08-30T21:06:06Z) - 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.