Theory of Semi-Instantiation in Abstract Argumentation

Reference : Theory of Semi-Instantiation in Abstract Argumentation


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/26048

Title :	Theory of Semi-Instantiation in Abstract Argumentation
Language :	English
Author, co-author :	Gabbay, Dov M. [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
Publication date :	2015
Journal title :	To appear Logica Universalis
Peer reviewed :	Yes
Keywords :	[en] Argumentation Semi-instantiation Boolean attack formations
Abstract :	[en] We study instantiated abstract argumentation frames of the form (S, R, I), where (S, R) is an abstract argumentation frame and where the arguments x of S are instantiated by I(x) as well formed formulas of a well known logic, for example as Boolean formulas or as predicate logic formulas or as modal logic formulas. We use the method of conceptual analysis to derive the properties of our proposed system. We seek to define the notion of complete extensions for such systems and provide algorithms for finding such extensions. We further develop a theory of instantiation in the abstract, using the framework of Boolean attack formations and of conjunctive and disjunctive attacks. We discuss applications and compare critically with the existing related literature.
Permalink :	http://hdl.handle.net/10993/26048

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	file.pdf		Publisher postprint	4.25 kB	View/Open

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