27 citations · 39 across the 20 of their papers we have counts for
20 papers
Multi-Winner Voting with Argumentative Ballots
Ryuta Arisaka, Hirotaka Ono
We introduce multi-winner voting with argumentative ballots (MVArg) and investigate theoretical properties. As our conceptual contribution, we generalise approval ballots to argume…
Discussion Graph Semantics of First-Order Logic with Equality for Reasoning about Discussion and Argumentation
Ryuta Arisaka
We make three contributions. First, we formulate a discussion-graph semantics for first-order logic with equality, enabling reasoning about discussion and argumentation in AI more…
Theme Aspect Argumentation Model for Handling Fallacies
Ryuta Arisaka, Ryoma Nakai, Yusuke Kawamoto +1
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 o…
Relational Argumentation Semantics
Ryuta Arisaka, Takayuki Ito
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…
Abstract Interpretation in Formal Argumentation: with a Galois Connection for Abstract Dialectical Frameworks and May-Must Argumentation (First Report)
Ryuta Arisaka, Takayuki Ito
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, t…
Numerical Abstract Persuasion Argumentation for Expressing Concurrent Multi-Agent Negotiations
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. The interleaving may alter the resource allocation assumed at…
Broadening Label-based Argumentation Semantics with May-Must Scales (May-Must Argumentation)
Ryuta Arisaka, Takayuki Ito
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, labe…
Formulating Manipulable Argumentation with Intra-/Inter-Agent Preferences
Ryuta Arisaka, Makoto Hagiwara, Takayuki Ito
From marketing to politics, exploitation of incomplete information through selective communication of arguments is ubiquitous. In this work, we focus on development of an argumenta…
Turing-Completeness of Dynamics in Abstract Persuasion Argumentation
Ryuta Arisaka
Abstract Persuasion Argumentation (APA) is a dynamic argumentation formalism that extends Dung argumentation with persuasion relations. In this work, we show through two-counter Mi…
Block Argumentation
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…
Abstractly Interpreting Argumentation Frameworks for Sharpening Extensions
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. Wh…
Abstract Argumentation / Persuasion / Dynamics
Ryuta Arisaka, Ken Satoh
The act of persuasion, a key component in rhetoric argumentation, may be viewed as a dynamics modifier. We extend Dung's frameworks with acts of persuasion among agents, and consid…
Coalition Formability Semantics with Conflict-Eliminable Sets of Arguments
Ryuta Arisaka, Ken Satoh
We consider abstract-argumentation-theoretic coalition formability in this work. Taking a model from political alliance among political parties, we will contemplate profitability,…
Predicate Gradual Logic and Linguistics
Ryuta Arisaka
There are several major proposals for treating donkey anaphora such as discourse representation theory and the likes, or E-Type theories and the likes. Every one of them works well…
Latent Belief Theory and Belief Dependencies: A Solution to the Recovery Problem in the Belief Set Theories
Ryuta Arisaka
The AGM recovery postulate says: assume a set of propositions X; assume that it is consistent and that it is closed under logical consequences; remove a belief P from the set minim…
On Nested Sequents for Constructive Modal Logics
Lutz Strassburger, Anupam Das, Ryuta Arisaka
We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b,…
Gradual Classical Logic for Attributed Objects - Extended in Re-Presentation
Ryuta Arisaka
Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long…
How do you revise your belief set with %$;@*?
Ryuta Arisaka
In the classic AGM belief revision theory, beliefs are static and do not change their own shape. For instance, if p is accepted by a rational agent, it will remain p to the agent.…
Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus
Ryuta Arisaka
Development of a contraction-free BI sequent calculus, be it in the sense of G3i or G4i, has not been successful in literature. We address the open problem by presenting such a seq…
Gradual Classical Logic for Attributed Objects
Ryuta Arisaka
There is knowledge. There is belief. And there is tacit agreement.' 'We may talk about objects. We may talk about attributes of the objects. Or we may talk both about objects and t…