Collective Argumentation and Disjunctive Logic Programming

An extension of an abstract argumentation framework is introduced that provides a direct representation of global conflicts between sets of arguments. The extension, called collective argumentation, turns out to be suitable for representing semantics of disjunctive logic programs. Collective argumentation theories are shown to possess a four-valued semantics, and are closely related to multiple-conclusion (Scott) consequence relations. Two special kinds of collective argumentation, positive and negative argumentation, are considered in which the opponents can share their arguments. Negative argumentation turns out to be especially appropriate for analyzing stable sets of arguments. Positive argumentation generalizes certain alternative semantics for logic programs.

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

[2]  John S. Schlipf.  Formalizing a logic for logic programming , 2005, Annals of Mathematics and Artificial Intelligence.

[3]  Dirk Vermeir,et al.  Robust Semantics for Argumentation Frameworks , 1999, J. Log. Comput..

[4]  David Poole,et al.  The Effect of Knowledge on Belief: Conditioning, Specificity and the Lottery Paradox in Default Reasoning , 1991, Artif. Intell..

[5]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[6]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[7]  Alexander Bochman,et al.  Biconsequence Relations: A Four-Valued Formalism of Reasoning with Inconsistency and Incompleteness , 1998, Notre Dame J. Formal Log..

[8]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[9]  Marco Schaerf.  Negation and Minimality in Disjunctive Databases , 1995, J. Log. Program..

[10]  Alexander Bochman.  A Logical Foundation for Logic Programming II: Semantics of General Logic Programs , 1998, J. Log. Program..

[11]  Li-Yan Yuan,et al.  An abductive approach to disjunctive logic programming , 2000, J. Log. Program..

[12]  Alexander Bochman.  On a Logical Basis of Normal Logic Program , 1996, Fundam. Informaticae.

[13]  Phan Minh Dung.  Acyclic Disjunctive Logic Programs with Abductive Procedures as Proof Procedure , 1992, FGCS.

[14]  Paolo Mancarella,et al.  Stable Theories for Logic Programs , 1991, ISLP.

[15]  Jürgen Dix,et al.  Causal Models of Disjunctive Logic Programs , 1994, ICLP.

[16]  Mark Wallace,et al.  Tight, Consistent and Computable Completions for Unrestricted Logic Programs , 1993, The Journal of Logic Programming.

[17]  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..