Abstract
The paper presents a logical study of abstract argumentation theory. It introduces a second-order modal logic, within which all main known semantics for abstract argumentation can be formalized, and studies the model checking game of this logic. The application of the game to the formalized semantics yields adequate game-theoretic proof procedures for all known extension-based semantics, in both their skeptical and credulous versions. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Grossi, D. (2011). An application of model checking games to abstract argumentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6953 LNAI, pp. 74–86). https://doi.org/10.1007/978-3-642-24130-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
