Skip Navigation


Logic Journal of IGPL Advance Access originally published online on January 1, 2009
Logic Journal of IGPL 2009 17(1):77-90; doi:10.1093/jigpal/jzn029
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
17/1/77    most recent
jzn029v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Caminada, M.
Right arrow Articles by Wu, Y.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

An argument game for stable semantics

Martin Caminada

University of Luxembourg, E-mail: martin.caminada{at}uni.lu

Yining Wu

University of Luxembourg, E-mail: yining.wu{at}uni.lu


   Abstract

In this paper, we present a discussion game for argumentation under stable semantics. Our work is inspired by Vreeswijk and Prakken, who have defined a similar game for preferred semantics. In the current paper, we restate Vreeswijk and Prakken's work using the approach of argument labellings and then show how it can be adjusted for stable semantics. The nature of the resulting argument game is somewhat unusual, since stable semantics does not satisfy the property of relevance.

Key Words: argumentation • argument labellings • discussion games • stable semantics

Received for publication 19 September 2008.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.