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

An algorithm for computing semi-stable semantics

Caminada, Martin 2007. An algorithm for computing semi-stable semantics. Lecture Notes in Computer Science 4724 , pp. 222-234. 10.1007/978-3-540-75256-1_22

PDF - Accepted Post-Print Version
Download (126kB) | Preview


The semi-stable semantics for formal argumentation has been introduced as a way of approximating stable semantics in situations where no stable extensions exist. Semi-stable semantics can be located between stable semantics and preferred semantics in the sense that every stable extension is a semi-stable extension and every semi-stable extension is a preferred extension. Moreover, in situations where at least one stable extension exists, the semi-stable extensions are equal to the stable extensions. In this paper we provide an outline of an algorithm for computing the semi-stable extensions, given an argumentation framework. We show that with a few modifications, the algorithm can also be used for computing stable and preferred semantics.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Springer Verlag
ISSN: 0302-9743
Date of First Compliant Deposit: 20 July 2016
Last Modified: 04 Jun 2017 12:01

Citation Data

Cited 67 times in Google Scholar. View in Google Scholar

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics