On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks

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.

[1]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[2]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[3]  David Poole,et al.  A Logical Framework for Default Reasoning , 1988, Artif. Intell..

[4]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[5]  Yannis Dimopoulos,et al.  Graph Theoretical Structures in Logic Programs and Default Theories , 1996, Theor. Comput. Sci..

[6]  Phan Minh Dung,et al.  An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..

[7]  Dirk Vermeir,et al.  Dialectic semantics for argumentation frameworks , 1999, ICAIL '99.

[8]  Antonis C. Kakas,et al.  Computing Argumentation in Logic Programming , 1999, J. Log. Comput..

[9]  Ana Gabriela Maguitman,et al.  Logical models of argument , 2000, CSUR.

[10]  Henry Prakken,et al.  Credulous and Sceptical Argument Games for Preferred Semantics , 2000, JELIA.

[11]  Henry Prakken,et al.  Logics for Defeasible Argumentation , 2001 .

[12]  Claudette Cayrol,et al.  Dialectical Proof Theories for the Credulous Preferred Semantics of Argumentation Frameworks , 2001, ECSQARU.

[13]  Trevor J. M. Bench-Capon,et al.  Coherence in finite argument systems , 2002, Artif. Intell..

[14]  Bernhard Nebel,et al.  On the computational complexity of assumption-based argumentation for default reasoning , 2002, Artif. Intell..

[15]  Trevor J. M. Bench-Capon,et al.  Two party immediate response disputes: Properties and efficiency , 2003, Artif. Intell..

[16]  Christos H. Papadimitriou,et al.  On kernels, defaults and even graphs , 2004, Annals of Mathematics and Artificial Intelligence.

[17]  Claudette Cayrol,et al.  A Reasoning Model Based on the Production of Acceptable Arguments , 2002, Annals of Mathematics and Artificial Intelligence.