Semi-stable semantics

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

Abstract

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:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	IOS Press
ISBN:	9781586036522
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84301

Citation Data

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

Actions (repository staff only)

Edit Item