Skip Navigation

Journal of Logic and Computation 2003 13(3):377-403; doi:10.1093/logcom/13.3.377
© 2003 by Oxford University Press
This Article
Right arrow Full Text (PDF)
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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (15)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cayrol, C.
Right arrow Articles by Mengin, J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?


Original Article

On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks

Claudette Cayrol1, Sylvie Doutre1 and Jerome Mengin1

1 IRIT, 118 route de Narbonne, 31062 Toulouse Cedex, France. E-mail: ccayrol{at}irit.fr, doutre{at}irit.fr, mengin{at}irit.fr

Argumentation is a form of reasoning, in which two agents cooperate in order to establish the validity of a given argument; this argument could be used to deduce some conclusion of interest. In this article, we look at the credulous and the sceptical decision problems under Dung's preferred semantics, that is, the problems of deciding if an argument belongs to one or to every preferred extension of an argumentation framework. We present two proof theories for the credulous decision problem and an algorithm which computes one of them. We show how these proof theories can be used for the sceptical decision problem in two particular cases of argumentation frameworks and we give an algorithm which answers that problem in the general case.

Keywords: Argumentation, decision problems, preferred semantics, proof theory.


Received 15 June 2002.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
J Logic ComputationHome page
P. M. Thang, P. M. Dung, and N. D. Hung
Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
J Logic Computation, June 26, 2009; (2009) exp032v1.
[Abstract] [PDF]


Home page
Logic Jnl IGPLHome page
M. Caminada and Y. Wu
An argument game for stable semantics
Logic Jnl IGPL, February 1, 2009; 17(1): 77 - 90.
[Abstract] [PDF]


Home page
BioinformaticsHome page
B. R. Jefferys, L. A. Kelley, M. J. Sergot, J. Fox, and M. J. E. Sternberg
Capturing expert knowledge with argumentation: a case study in bioinformatics
Bioinformatics, April 15, 2006; 22(8): 924 - 933.
[Abstract] [Full Text] [PDF]



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.