Paper published in a journal (Scientific congresses, symposiums and conference proceedings)
Computational Complexity of Input/Output Logic
Sun, Xin; Ambrossio, Diego Agustin
2015In Lecture Notes in Computer Science, 9426
Peer reviewed
 

Files


Full Text
MIWAI.pdf
Publisher postprint (210.23 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
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.
Disciplines :
Computer science
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)
External co-authors :
yes
Language :
English
Title :
Computational Complexity of Input/Output Logic
Publication date :
2015
Event name :
The 9th Multi-Disciplinary International Workshop on Artificial Intelligence 2015 (MIWAI)
Event place :
Fuzhou, China
Event date :
November 13-15, 2015
Audience :
International
Journal title :
Lecture Notes in Computer Science
ISSN :
0302-9743
eISSN :
1611-3349
Publisher :
Springer, Berlin, Germany
Volume :
9426
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 27 January 2016

Statistics


Number of views
86 (7 by Unilu)
Number of downloads
169 (3 by Unilu)

Scopus citations®
 
2
Scopus citations®
without self-citations
2
OpenCitations
 
0
WoS citations
 
2

Bibliography


Similar publications



Contact ORBilu