15th European Conference on Artificial Intelligence
|July 21-26 2002 Lyon France|
Ralf Schweimeier, Michael Schroeder
The concept of argumentation may be used to give a formal semantics to a variety of assumption based reasoning formalisms. In particular, various argumentation semantics have been proposed for logic programming with default negation. For extended logic programming, i.e. logic programming with two kinds of negation, there arise a variety of notions of attack on an argument, and therefore a variety of different argumentation semantics. The purpose of this paper is to shed some light on these various semantics, and examine the relationship between different semantics. We identify a number of different notions of attack for extended logic programs, and compare the resulting least fixpoint semantics, defined via acceptability of arguments. We investigate the validity of the coherence principle and notions of consistency for these semantics.
Keywords: Nonmonotonic Reasoning, Logic Programming
Citation: Ralf Schweimeier, Michael Schroeder: Notions of Attack and Justified Arguments for Extended Logic Programs. In F. van Harmelen (ed.): ECAI2002, Proceedings of the 15th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2002, pp.536-540.