Turing-Completeness of Dynamics in Abstract Persuasion Argumentation
arXiv:1903.07837v12 citations
Originality Highly original
AI Analysis
This work addresses a foundational problem in computational argumentation theory, establishing the theoretical limits of APA, which is incremental as it builds on Dung argumentation.
The paper tackled the problem of determining the computational power of dynamics in Abstract Persuasion Argumentation (APA), and the result was a proof that APA dynamics is Turing-complete, achieved through encoding a two-counter Minsky machine.
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.