no code implementations • 30 May 2022 • Ryuta Arisaka, Ryoma Nakai, Yusuke Kawamoto, Takayuki Ito
We present core formal constraints for the theme aspect argumentation model and then more formal constraints that improve its fallacy identification capability.
no code implementations • 26 Apr 2021 • Ryuta Arisaka, Takayuki Ito
In this paper, we propose a fresh perspective on argumentation semantics, to view them as a relational database.
no code implementations • 22 Jul 2020 • Ryuta Arisaka, Takayuki Ito
In this context, there is a more recently proposed formalism of may-must argumentation (MMA) that enforces still local but more abstract labelling conditions.
no code implementations • 23 Jan 2020 • Ryuta Arisaka, Takayuki Ito
A negotiation process by 2 agents e1 and e2 can be interleaved by another negotiation process between, say, e1 and e3.
no code implementations • 16 Jan 2020 • Ryuta Arisaka, Takayuki Ito
In this work, we contemplate a way of broadening it by accommodating may- and must- conditions for an argument to be accepted or rejected, as determined by the number(s) of rejected and accepted attacking arguments.
no code implementations • 9 Sep 2019 • Ryuta Arisaka, Makoto Hagiwara, Takayuki Ito
From marketing to politics, exploitation of incomplete information through selective communication of arguments is ubiquitous.
no code implementations • 19 Mar 2019 • Ryuta Arisaka
Abstract Persuasion Argumentation (APA) is a dynamic argumentation formalism that extends Dung argumentation with persuasion relations.
no code implementations • 18 Jan 2019 • Ryuta Arisaka, Stefano Bistarelli, Francesco Santini
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 validated C. Argumentation involving such arguments requires us to potentially consider an argument as a coherent block of argumentation, i. e. an argument may itself be an argumentation.
no code implementations • 5 Feb 2018 • Ryuta Arisaka, Jeremie Dauphin
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.
no code implementations • 29 May 2017 • Ryuta Arisaka, Ken Satoh
The act of persuasion, a key component in rhetoric argumentation, may be viewed as a dynamics modifier.
no code implementations • 2 May 2016 • Ryuta Arisaka, Ken Satoh
As is also commonly understood, however, a coalition may deliver benefits to a group X at the sacrifice of something that X was able to do before coalition formation, which X may be no longer able to do under the coalition.
no code implementations • 17 Mar 2016 • Ryuta Arisaka
Furthermore, I show that Aristotle's syllogisms and conversion are realisable in this logic.
no code implementations • 6 Jul 2015 • Ryuta Arisaka
In order that such situations can be also handled, we will enrich the latent belief theory with belief dependencies among attributive beliefs, recording the information as to which belief is supported of its existence by which beliefs.
no code implementations • 21 Apr 2015 • Ryuta Arisaka
Often, when we accept some information p, what is actually accepted is not the whole p, but only a portion of it; not necessarily because we select the portion but because p must be perceived.
no code implementations • 19 Apr 2015 • Ryuta Arisaka
In this work, I present gradual logic which materialises the observation that we cannot tell apart whether a so-regarded atomic entity is atomic or is just atomic enough not to be considered non-atomic.
no code implementations • 24 Apr 2014 • Ryuta Arisaka
This work inspects tacit agreements on assumptions about the relation between objects and their attributes, and studies a way of expressing them, presenting as the result what we term gradual logic in which the sense of truth gradually shifts.