Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

• Abstract
• Abstract (translated by Google)
• URL
• PDF

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.

Abstract (translated by Google)

URL

http://arxiv.org/abs/1903.07837

PDF

http://arxiv.org/pdf/1903.07837