Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

Abstract

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.

Cited by in corpus (1)

• Numerical Abstract Persuasion Argumentation for Expressing Concurrent Multi-Agent Negotiations