English

Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

Logic in Computer Science 2019-03-20 v1 Artificial Intelligence

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.

Keywords

Cite

@article{arxiv.1903.07837,
  title  = {Turing-Completeness of Dynamics in Abstract Persuasion Argumentation},
  author = {Ryuta Arisaka},
  journal= {arXiv preprint arXiv:1903.07837},
  year   = {2019}
}