Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Arisaka, Ryuta"'
Autor:
Arisaka, Ryuta
We formulate discussion graph semantics of first-order logic with equality for reasoning about discussion and argumentation as naturally as we would reason about sentences. While there are a few existing proposals to use a formal logic for reasoning
Externí odkaz:
http://arxiv.org/abs/2406.12163
From daily discussions to marketing ads to political statements, information manipulation is rife. It is increasingly more important that we have the right set of tools to defend ourselves from manipulative rhetoric, or fallacies. Suitable techniques
Externí odkaz:
http://arxiv.org/abs/2205.15141
Autor:
Arisaka, Ryuta, Ito, Takayuki
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, relati
Externí odkaz:
http://arxiv.org/abs/2104.12386
Autor:
Arisaka, Ryuta, Ito, Takayuki
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, to each argument. While a classical labelling-based approach applies gl
Externí odkaz:
http://arxiv.org/abs/2007.12474
Autor:
Arisaka, Ryuta, Ito, Takayuki
A negotiation process by 2 agents e1 and e2 can be interleaved by another negotiation process between, say, e1 and e3. The interleaving may alter the resource allocation assumed at the inception of the first negotiation process. Existing proposals fo
Externí odkaz:
http://arxiv.org/abs/2001.08335
Autor:
Arisaka, Ryuta, Ito, Takayuki
The semantics as to which set of arguments in a given argumentation graph may be acceptable (acceptability semantics) can be characterised in a few different ways. Among them, labelling-based approach allows for concise and flexible determination of
Externí odkaz:
http://arxiv.org/abs/2001.05730
From marketing to politics, exploitation of incomplete information through selective communication of arguments is ubiquitous. In this work, we focus on development of an argumentation-theoretic model for manipulable multi-agent argumentation, where
Externí odkaz:
http://arxiv.org/abs/1909.03616
Autor:
Arisaka, Ryuta
Abstract Persuasion Argumentation (APA) is a dynamic argumentation formalism that extends Dung argumentation with persuasion relations. In this work, we show through two-counter Minsky machine encoding that APA dynamics is Turing-complete.
Externí odkaz:
http://arxiv.org/abs/1903.07837
We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not have vali
Externí odkaz:
http://arxiv.org/abs/1901.06378
Autor:
Arisaka, Ryuta, Dauphin, Jeremie
Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in particular
Externí odkaz:
http://arxiv.org/abs/1802.01526