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

Semi-stable semantics

Caminada, Martin 2006. Semi-stable semantics. In: Dunne, Paul E. and Bench-Capon, Trevor J. M. eds. Computational Models of Argument, Vol. 144. Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 121-130.

Full text not available from this repository.


In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that there exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, then the semi-stable extensions coincide with the stable extensions. This, and other properties, make semi-stable semantics an attractive alternative for the more traditional stable semantics, which until now has been widely used in fields such as logic programming and answer set programming.

Item Type: Book Section
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: IOS Press
ISBN: 9781586036522
Last Modified: 08 Apr 2020 14:17

Citation Data

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

Actions (repository staff only)

Edit Item Edit Item