AI Chat AI Image Generator AI Video Text to Speech

Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

03/19/2019

∙

by Ryuta Arisaka, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 05/29/2017

Abstract Argumentation / Persuasion / Dynamics

The act of persuasion, a key component in rhetoric argumentation, may be...

0 Ryuta Arisaka, et al. ∙

research

∙ 08/24/2011

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation

The aim of this paper is to announce the release of a novel system for a...

0 Wolfgang Dvorák, et al. ∙

research

∙ 01/23/2020

Numerical Abstract Persuasion Argumentation for Expressing Concurrent Multi-Agent Negotiations

A negotiation process by 2 agents e1 and e2 can be interleaved by anothe...

0 Ryuta Arisaka, et al. ∙

research

∙ 07/22/2020

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

Labelling-based formal argumentation relies on labelling functions that ...

0 Ryuta Arisaka, et al. ∙

research

∙ 10/11/2018

AFRA: Argumentation framework with recursive attacks

The issue of representing attacks to attacks in argumentation is receivi...

0 Pietro Baroni, et al. ∙

research

∙ 03/05/2019

An approach to Decision Making based on Dynamic Argumentation Systems

In this paper, we introduce a formalism for single-agent decision making...

0 Edgardo Ferretti, et al. ∙

research

∙ 09/07/2021

The pyglaf argumentation reasoner (ICCMA2021)

The pyglaf reasoner takes advantage of circumscription to solve computat...

0 Mario Alviano, et al. ∙