A discussion game for grounded semantics

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2015. A discussion game for grounded semantics. Presented at: 3rd International Workshop on Theory and Applications of Formal Argumentation, Buenos Aires, Argentina, 25-26 July 2015. Published in: Black, Elizabeth, Modgil, Sanjay and Oren, Nir eds. Theory and Applications of Formal Argumentation: Third International Workshop, TAFA 2015, Buenos Aires, Argentina, July 25-26, 2015, Revised Selected Papers. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.9524 Springer, pp. 59-73. 10.1007/978-3-319-28460-6_4

Full text not available from this repository.

Abstract

We introduce an argument-based discussion game where the ability to win the game for a particular argument coincides with the argument being in the grounded extension. Our game differs from previous work in that (i) the number of moves is linear (instead of exponential) w.r.t. the strongly admissible set that the game is constructing, (ii) winning the game does not rely on cooperation from the other player (that is, the game is winning strategy based), (iii) a single game won by the proponent is sufficient to show grounded membership, and (iv) the game has a number of properties that make it more in line with natural discussion.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Springer
ISBN:	9783319284590
ISSN:	0302-9743
Last Modified:	01 Nov 2022 09:31
URI:	https://orca.cardiff.ac.uk/id/eprint/88275

Citation Data

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

Actions (repository staff only)

Edit Item