Turing-Completeness of Dynamics in Abstract Persuasion Argumentation
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Mar-19-2019