Books Online
Not logged in
- Login
Not Signed In
You are here: Skip Navigation Links

Frontiers in Artificial Intelligence and Applications
Volume 144, 2006
Computational Models of Argument - Proceedings of COMMA 2006
Edited by Paul E. Dunne, Trevor J.M. Bench-Capon
ISBN 978-1-58603-652-2

Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments 97 - 108


Abstract

The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments, but in a recent paper we adapted it to support such attacks, and proved that this adapted framework enjoyed the same formal properties as that of Dung. One problem posed by Dung's original framework, which was neglected for some time, is how to compute preferred extensions of the argumentation systems. However, in 2001, in a paper by Doutre and Mengin, a procedure was given for enumerating preferred extensions for these systems. In this paper we propose a method for enumerating preferred extensions of the potentially more complex systems, where joint attacks are allowed. The method is inspired by the one given by Doutre and Mengin.


  Full Text PDF
Navigation
  Home
  Back
  Forward

Article
  Full Text PDF

$20.00 / € 15,00