%0 Conference Paper
%B Proceedings of Symposium on Logical Foundations of Computer Science (LFCS'09)
%D 2009
%T The NP-completeness of reflected fragments of justification logics
%A Buss, Samuel R.
%A Roman Kuznets
%E Sergei Artemov
%E Nerode, Anil
%X Justification Logic studies epistemic and provability phenomena by introducing justifications/proofs into the language in the form of justification terms. Pure justification logics serve as counterparts of traditional modal epistemic logics, and hybrid logics combine epistemic modalities with justification terms. The computational complexity of pure justification logics is typically lower than that of the corresponding modal logics. Moreover, the so-called reflected fragments, which still contain complete information about the respective justification logics, are known to be in~NP for a wide range of justification logics, pure and hybrid alike. This paper shows that, under reasonable additional restrictions, these reflected fragments are NP-complete, thereby proving a matching lower bound.
%B Proceedings of Symposium on Logical Foundations of Computer Science (LFCS'09)
%S Lecture Notes in Computer Science
%V 5407
%P 122-136
%G eng
%U http://www.iam.unibe.ch/ltgpub/2009/bk09.pdf
%R 10.1007/978-3-540-92687-0_9