Search Results for author: Ryuta Arisaka

Found 15 papers, 0 papers with code

Relational Argumentation Semantics

no code implementations26 Apr 2021 Ryuta Arisaka, Takayuki Ito

In this paper, we propose a fresh perspective on argumentation semantics, to view them as a relational database.

Abstract Interpretation in Formal Argumentation: with a Galois Connection for Abstract Dialectical Frameworks and May-Must Argumentation (First Report)

no code implementations22 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.

Numerical Abstract Persuasion Argumentation for Expressing Concurrent Multi-Agent Negotiations

no code implementations23 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.

Abstract Argumentation

Broadening Label-based Argumentation Semantics with May-Must Scales (May-Must Argumentation)

no code implementations16 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.

Formulating Manipulable Argumentation with Intra-/Inter-Agent Preferences

no code implementations9 Sep 2019 Ryuta Arisaka, Makoto Hagiwara, Takayuki Ito

From marketing to politics, exploitation of incomplete information through selective communication of arguments is ubiquitous.

Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

no code implementations19 Mar 2019 Ryuta Arisaka

Abstract Persuasion Argumentation (APA) is a dynamic argumentation formalism that extends Dung argumentation with persuasion relations.

Block Argumentation

no code implementations18 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.

Abstract Argumentation

Abstractly Interpreting Argumentation Frameworks for Sharpening Extensions

no code implementations5 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.

Abstract Argumentation / Persuasion / Dynamics

no code implementations29 May 2017 Ryuta Arisaka, Ken Satoh

The act of persuasion, a key component in rhetoric argumentation, may be viewed as a dynamics modifier.

Abstract Argumentation

Coalition Formability Semantics with Conflict-Eliminable Sets of Arguments

no code implementations2 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.

Abstract Argumentation

Predicate Gradual Logic and Linguistics

no code implementations17 Mar 2016 Ryuta Arisaka

Furthermore, I show that Aristotle's syllogisms and conversion are realisable in this logic.

Latent Belief Theory and Belief Dependencies: A Solution to the Recovery Problem in the Belief Set Theories

no code implementations6 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.

How do you revise your belief set with %$;@*?

no code implementations21 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.

Gradual Classical Logic for Attributed Objects - Extended in Re-Presentation

no code implementations19 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.

Gradual Classical Logic for Attributed Objects

no code implementations24 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.