The NP-completeness of reflected fragments of justification logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5407 LNCS, Issue , 2009, Pages 122-136

  Buss, Samuel R ^a   Kuznets, Roman ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE INFORMATION; EPISTEMIC LOGIC; HYBRID LOGIC; LOWER BOUNDS; MODAL LOGIC; NP COMPLETE; NP-COMPLETENESS;

COMPUTER SCIENCE; CONTROL THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 67650507638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92687-0_9     Document Type: Conference Paper

References (15)

1. [AK06] Artemov, S.N., Kuznets, R.: Logical omniscience via proof complexity. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 135-149. Springer, Heidelberg(2006)
2. [Art95] Artemov, S.N.: Operational modal logic. Technical Report MSI 95-29, Cornell University (December 1995)
3. [Art01] Artemov, S.N.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1-36 (2001)
4. [Art06] Artemov, S.N.: Justified common knowledge. Theoretical Computer Science 357(1-3), 4-22 (2006)
5. [Art08a] Artemov, S.N.: The logic of justification. Technical Report TR-2008010, CUNY Ph.D. Program in Computer Science (September 2008)
6. [Art08b] Artemov, S.N.: Why do we need Justification Logic? Technical Report TR- 2008014, CUNY Ph.D. Program in Computer Science (September 2008)
7. [BB93] Bonet, M.L., Buss, S.R.: The deduction rule and linear and near-linear proof simulations. Journal of Symbolic Logic 58(2), 688-709 (1993)
8. [Bre00] Brezhnev, V.N.: On explicit counterparts of modal logics. Technical Report CFIS 2000-05, Cornell University (2000)
9. [Kru03] Krupski, N.V.: On the complexity of the reflected logic of proofs. Technical Report TR-2003007, CUNY Ph.D. Program in Computer Science (May 2003)
10. [Kru06] Krupski, N.V.: On the complexity of the reflected logic of proofs. Theoretical Computer Science 357(1-3), 136-142 (2006)[Kuz00] Kuznets, R.: On the complexity of explicit modal logics. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 371-383. Springer, Heidelberg (2000); Errata concerning the explicit counterparts of D and D4 are published as [Kuz08b]
11. [Kuz08a] Kuznets, R.: Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center (May 2008)
12. [Kuz08b] Kuznets, R.: Complexity through tableaux in justification logic. In: Abstracts of Plenary Talks, Tutorials, Special Sessions, Contributed Talks of Logic Colloquium (LC 2008), Bern, Switzerland, pp. 38-39 (Abstract) (July 3-8, 2008)
13. [Kuz08c] Kuznets, R.: Self-referentiality of justified knowledge. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 228-239. Springer, Heidelberg (2008)
14. [Lad77] Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing 6(3), 467-480 (1977)
15. 2 -complete. Annals of Pure and Applied Logic 145(3), 223-239 (2007)