Show simple item record

dc.contributor.authorKakas, Antonis C.en
dc.contributor.authorMancarella, P.en
dc.creatorKakas, Antonis C.en
dc.creatorMancarella, P.en
dc.description.abstractArguments need to be judged against other arguments. The decision to accept or reject an argument is generally a global decision that involves examining the same question for other arguments that oppose or can defend the argument in question. This article presents the acceptability semantics for abstract argumentation that through a recursive definition gives a global assignment of the acceptable and non-acceptable subsets of arguments. This semantics stems from the aim to formalize directly the generally accepted intuition that: 'An argument can be accepted if and only if all its challenging arguments can be rejected.' The acceptability semantics tightly integrates the notion of defending against a challenging argument by counter-attacking it with the notion of self-defeating (or self-rejecting) arguments that (help to) bring about their own non-acceptability. The proposal is motivated by earlier studies of the semantics of Logic Programming (LP) in terms of argumentation, where the basic well founded and stable model semantics of LP can be uniformly captured using a recursively defined argumentation semantics for Negation as Failure and where these standard semantics of LP can be further extended through argumentation. © The Author, 2012. Published by Oxford University Press. All rights reserved.en
dc.sourceJournal of Logic and Computationen
dc.subjectartificial intelligenceen
dc.subjectLogic programmingen
dc.subjectStable model semanticsen
dc.subjectAbstract argumentationen
dc.subjectNegation as failuresen
dc.subjectAcceptability semanticsen
dc.subjectArgumentation semanticsen
dc.subjectcomputational logicen
dc.subjectRecursive definitionsen
dc.titleOn the semantics of abstract argumentationen
dc.description.endingpage1015 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notes<p>Cited By :5</p>en
dc.source.abbreviationJ Logic Computen
dc.contributor.orcidKakas, Antonis C. [0000-0001-6773-3944]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record