Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

On the issue of reinstatement in argumentation

Caminada, Martin 2006. On the issue of reinstatement in argumentation. Lecture Notes in Computer Science 4160 , pp. 111-123. 10.1007/11853886_11

Full text not available from this repository.


Dung’s theory of abstract argumentation frameworks [1] led to the formalization of various argument-based semantics, which are actually particular forms of dealing with the issue of reinstatement. In this paper, we re-examine the issue of semantics from the perspective of postulates. In particular, we ask ourselves the question of which (minimal) requirements have to be fulfilled by any principle for handling reinstatement, and how this relates to Dung’s standard semantics. Our purpose is to shed new light on the ongoing discussion on which semantics is most appropriate.

Item Type: Article
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Springer Verlag
ISSN: 0302-9743
Last Modified: 04 Jun 2017 08:45

Citation Data

Cited 218 times in Google Scholar. View in Google Scholar

Actions (repository staff only)

Edit Item Edit Item