Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue
 
home
browse
current
etoc
authors
subinfo
subscribers
samples

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Computational Dialectics

Volume 13, Issue 3, June 2003: pp. 405-428

Original Article
Collective Argumentation and Disjunctive Logic Programming

Alexander Bochman1

1Computer Science Department, Holon Academic Institute of Technology, Israel. E-mail: bochmana@hait.ac.il

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 analysing stable sets of arguments. Positive argumentation generalizes certain alternative semantics for logic programs.

Keywords: Argumentation theory, disjunctive logic programming.

Table of Contents   Full-Text PDF (161 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement