Notes on Abstract Argumentation Theory

2018/06/18 by Anthony P. Young, Young, Anthony Peter
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation

paper · pdf · doi:10.48550/arxiv.1806.07709

openalex publication_date 2018/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note reviews Section 2 of Dung's seminal 1995 paper on abstract argumentation theory. In particular, we clarify and make explicit all of the proofs mentioned therein, and provide more examples to illustrate the definitions, with the aim to help readers approaching abstract argumentation theory for the first time. However, we provide minimal commentary and will refer the reader to Dung's paper for the intuitions behind various concepts. The appropriate mathematical prerequisites are provided in the appendices.

Citations

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

Related

• Necessary and Sufficient Explanations in Abstract Argumentation
• Abstract Interpretation in Formal Argumentation: with a Galois Connection for Abstract Dialectical Frameworks and May-Must Argumentation (First Report)
• On the Graded Acceptability of Arguments in Abstract and Instantiated Argumentation
• "Minimal defence": a refinement of the preferred semantics for argumentation frameworks
• A Formalisation of Abstract Argumentation in Higher-Order Logic