Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

2019/03/19 by Ryuta Arisaka, Arisaka, Ryuta
Computer Science · Social Sciences · #Access Control and Trust #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation

paper · pdf · doi:10.48550/arxiv.1903.07837

openalex publication_date 2019/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Related

• Abstract Argumentation / Persuasion / Dynamics
• The power of clockings
• Turing Completeness of Finite, Epistemic Programs
• Complexity Results of Persuasion
• Expressivity of AuDaLa: Turing Completeness and Possible Extensions