Representation Equivalences among Argumentation Frameworks

Reference : Representation Equivalences among Argumentation Frameworks


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/36359

Title :	Representation Equivalences among Argumentation Frameworks
Language :	English
Author, co-author :	Liao, Beishui [Zhejiang University]
	van der Torre, Leon [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2018
Main document title :	Computational Models of Argument
Publisher :	IOS Press
Peer reviewed :	Yes
Event name :	Seventh International Conference on Computational Models of Argument
Event date :	12-14/09/2018
Keywords :	[en] Formal argumentation ; abstract argumentation semantics ; representation equivalence
Abstract :	[en] In Dung’s abstract argumentation theory, an extension can be represented by subsets of it in the sense that from each of these subsets, the extension can be obtained again by iteratively applying the characteristic function. Such so-called regular representations can be used to differentiate argumentation frameworks having the same extensions. In this paper we provide a full characterization of relations between seven different types of representation equivalence.
Permalink :	http://hdl.handle.net/10993/36359

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	main.pdf		Author preprint	114.5 kB	View/Open

All documents in ORBi^lu are protected by a user license.