Forbidden Sets in Argumentation Semantics



Dunne, Paul E ORCID: 0000-0002-6033-3742
(2016) Forbidden Sets in Argumentation Semantics. In: 6th International Comf. on Computational Models of Argument (COMMA), 2016-9-14 - 2016-9-16, Potsdam, Germany.

Access the full-text of this item by clicking on the Open Access link.
[img] Text
01_comma2016_Dunne.pdf - Submitted version

Download (272kB)

Abstract

We consider an alternative interpretation of classical Dung argumentation framework (af) semantics by introducing the concept of “forbidden sets”. In informal terms, such sets are well-defined with respect to any extension-based semantics and reflect those subsets of argument that collectively can never form part of an acceptable solution. The forbidden set paradigm thus provides a parametric treatment of extension-based semantics. We present some general properties of forbidden set structures and describe the interaction between forbidden sets for a number of classical semantics. Finally we establish some initial complexity results in the arena of forbidden set decision problems.

Item Type: Conference or Workshop Item (Unspecified)
Uncontrolled Keywords: abstract argumentation frameworks, extension-based semantics, computational complexity
Depositing User: Symplectic Admin
Date Deposited: 16 Sep 2016 10:37
Last Modified: 04 Feb 2024 15:50
DOI: 10.3233/978-1-61499-686-6-275
Open Access URL: http://ebooks.iospress.nl/volumearticle/45267
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3002657