Reference : Computational Complexity of Input/Output Logic
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/23943
Computational Complexity of Input/Output Logic
English
Sun, Xin mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Ambrossio, Diego Agustin mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2015
Lecture Notes in Computer Science
Springer
9426
Yes
International
0302-9743
1611-3349
Berlin
Germany
The 9th Multi-Disciplinary International Workshop on Artificial Intelligence 2015 (MIWAI)
November 13-15, 2015
Fuzhou
China
[en] input/output logic ; complexity ; norm
[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.
http://hdl.handle.net/10993/23943

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
MIWAI.pdfPublisher postprint205.3 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.