An algorithm for computing semi-stable semantics

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 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

Preview

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

Abstract

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:	02 Dec 2024 02:00
URI:	https://orca.cardiff.ac.uk/id/eprint/84298

Citation Data

Cited 53 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item