Computing Science Seminar. Caminada on "Strong Admissibility Revisited"

Computing Science Seminar. Caminada on "Strong Admissibility Revisited"
-

This is a past event

Abstract

We re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its extension-based and in its labelling-based form. Moreover, we show that strong admissibility plays a vital role in discussion-based proof procedures for grounded semantics. In particular it allows one to compare the performance of alternative dialectical proof procedures for grounded semantics, and obtain some remarkable differences between the Standard Grounded Game and the Grounded Persuasion Game.

Paper link:

http://homepages.abdn.ac.uk/martin.caminada/pages/publications/StrAdmCOMMA14.pdf

Speaker
Martin Caminada
Hosted by
Adam Wyner
Venue
Meston 2