The NP-Completeness of Reflected Fragments of Justification Logics

Authors:
Samuel R. Buss;Roman Kuznets
Affiliations:
Department of Mathematics, University of California, San Diego, USA CA 92093-0112;Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland CH-3012
Venue:
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Year:
2009

Citing 6
Cited 1

On the Complexity of Explicit Modal Logics

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Justified common knowledge

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
On the complexity of the reflected logic of proofs

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Complexity issues in justification logic

Complexity issues in justification logic
Self-referentiality of justified knowledge

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Logical omniscience via proof complexity

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

A complexity question in justification logic

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.