An algorithm for stage semantics

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2010. An algorithm for stage semantics. Baroni, P., Cerutti, F., Giacomin, M. and Simari, G. R., eds. Computational Models of Argument: Proceedings of COMMA 2010, Vol. 216. Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 147-158. (10.3233/978-1-60750-619-5-147)

Preview

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

Abstract

In the current paper, we re-examine the concept of stage semantics, which is one of the oldest semantics for abstract argumentation. Using a formal treatment of its properties, we explain how the intuition behind stage semantics differs from the intuition behind the admissibility based semantics that most scholars in argumentation theory are familiar with. We then provide a labelling-based algorithm for computing all stage extensions, based on earlier algorithms for computing all preferred, stable and semi-stable extensions.

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:	9781607506188
Date of First Compliant Deposit:	20 July 2016
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84292

Citation Data

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

Actions (repository staff only)

Edit Item