Computational Complexity of Input/Output Logic

Reference : Computational Complexity of Input/Output Logic


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

Title :	Computational Complexity of Input/Output Logic
Language :	English
Author, co-author :	Sun, Xin [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Ambrossio, Diego Agustin [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Publication date :	2015
Journal title :	Lecture Notes in Computer Science
Publisher :	Springer
Volume :	9426
Peer reviewed :	Yes
Audience :	International
ISSN :	0302-9743
e-ISSN :	1611-3349
City :	Berlin
Country :	Germany
Event name :	The 9th Multi-Disciplinary International Workshop on Artificial Intelligence 2015 (MIWAI)
Event date :	November 13-15, 2015
Event place (city) :	Fuzhou
Event country :	China
Keywords :	[en] input/output logic ; complexity ; norm
Abstract :	[en] Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output logics. We show that the lower bound of the complexity of the fulfillment problem of 4 input/output logics is coNP, while the upper bound is either coNP or P^NP.
Permalink :	http://hdl.handle.net/10993/23943

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	MIWAI.pdf		Publisher postprint	205.3 kB	View/Open

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