加载中…
2019-03-19
Turing-Completeness of Dynamics in Abstract Persuasion Argumentation
Ryuta Arisaka
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本