Turing-Completeness of Dynamics in Abstract Persuasion Argumentation
classification
💻 cs.LO
cs.AI
keywords
argumentationpersuasionabstractdynamicsdungdynamicencodingextends
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.