메뉴 건너뛰기




Volumn 6300 LNCS, Issue , 2010, Pages 61-74

Tracking evidence

Author keywords

epistemic logic; evidence; justification

Indexed keywords

BASIC LOGIC; EPISTEMIC LOGIC; EVIDENCE; JUSTIFICATION; LOGIC SYSTEMS; LOGICAL FRAMEWORKS;

EID: 77956573866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15025-8_3     Document Type: Conference Paper
Times cited : (13)

References (22)
  • 1
    • 0004250484 scopus 로고
    • Operational modal logic
    • Cornell University
    • Artemov, S.: Operational modal logic. Technical Report MSI 95-129, Cornell University (1995)
    • (1995) Technical Report MSI , pp. 95-129
    • Artemov, S.1
  • 2
    • 0035607160 scopus 로고    scopus 로고
    • Explicit provability and constructive semantics
    • Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1-36 (2001)
    • (2001) Bulletin of Symbolic Logic , vol.7 , Issue.1 , pp. 1-36
    • Artemov, S.1
  • 3
    • 33745371051 scopus 로고    scopus 로고
    • Justified common knowledge
    • Artemov, S.: Justified common knowledge. Theoretical Computer Science 357(1-3), 4-22 (2006)
    • (2006) Theoretical Computer Science , vol.357 , Issue.1-3 , pp. 4-22
    • Artemov, S.1
  • 4
    • 84989195596 scopus 로고    scopus 로고
    • The logic of justification
    • Artemov, S.: The Logic of Justification. The Review of Symbolic Logic 1(4), 477-513 (2008)
    • (2008) The Review of Symbolic Logic , vol.1 , Issue.4 , pp. 477-513
    • Artemov, S.1
  • 5
    • 70350641342 scopus 로고    scopus 로고
    • Logical omniscience as a computational complexity problem
    • Heifetz, A. (ed.) Theoretical Aspects of Rationality and Knowledge, Stanford University, California, July 6-8. ACM, New York
    • Artemov, S., Kuznets, R.: Logical omniscience as a computational complexity problem. In: Heifetz, A. (ed.) Theoretical Aspects of Rationality and Knowledge. Proceedings of the Twelfth Conference (TARK 2009), Stanford University, California, July 6-8, pp. 14-23. ACM, New York (2009)
    • (2009) Proceedings of the Twelfth Conference (TARK 2009) , pp. 14-23
    • Artemov, S.1    Kuznets, R.2
  • 6
    • 29144513937 scopus 로고    scopus 로고
    • Introducing justification into epistemic logic
    • Artemov, S., Nogina, E.: Introducing justification into epistemic logic. J. of Logic and Computation 15(6), 1059-1073 (2005)
    • (2005) J. of Logic and Computation , vol.15 , Issue.6 , pp. 1059-1073
    • Artemov, S.1    Nogina, E.2
  • 7
    • 0040899998 scopus 로고    scopus 로고
    • On explicit counterparts of modal logics
    • Cornell University
    • Brezhnev, V.: On explicit counterparts of modal logics. Technical Report CFIS 2000-2005. Cornell University (2000)
    • (2000) Technical Report CFIS 2000-2005
    • Brezhnev, V.1
  • 8
    • 33745669343 scopus 로고    scopus 로고
    • Making knowledge explicit: How hard it is
    • Brezhnev, V., Kuznets, R.: Making knowledge explicit: How hard it is. Theoretical Computer Science 357(1-3), 23-34 (2006)
    • (2006) Theoretical Computer Science , vol.357 , Issue.1-3 , pp. 23-34
    • Brezhnev, V.1    Kuznets, R.2
  • 9
    • 33745920187 scopus 로고    scopus 로고
    • Logic of proofs for bounded arithmetic
    • Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. Springer, Heidelberg
    • Goris, E.: Logic of proofs for bounded arithmetic. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.3967, pp. 191-201. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3967 , pp. 191-201
    • Goris, E.1
  • 13
    • 8644260892 scopus 로고    scopus 로고
    • The logic of proofs, semantically
    • Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132(1), 1-25 (2005)
    • (2005) Annals of Pure and Applied Logic , vol.132 , Issue.1 , pp. 1-25
    • Fitting, M.1
  • 15
    • 33745381221 scopus 로고    scopus 로고
    • On the complexity of the reflected logic of proofs
    • Krupski, N.V.: On the complexity of the reflected logic of proofs. Theoretical Computer Science 357(1), 136-142 (2006)
    • (2006) Theoretical Computer Science , vol.357 , Issue.1 , pp. 136-142
    • Krupski, N.V.1
  • 16
    • 23044519702 scopus 로고    scopus 로고
    • On the complexity of explicit modal logics
    • Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. Springer, Heidelberg
    • 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)
    • (2000) LNCS , vol.1862 , pp. 371-383
    • Kuznets, R.1
  • 19
    • 84947916318 scopus 로고    scopus 로고
    • Models for the logic of proofs
    • Adian, S., Nerode, A. (eds.) LFCS 1997. Springer, Heidelberg
    • Mkrtychev, A.: Models for the logic of proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol.1234, pp. 266-275. Springer, Heidelberg (1997)
    • (1997) LNCS , vol.1234 , pp. 266-275
    • Mkrtychev, A.1
  • 20
    • 0004026797 scopus 로고
    • Williams and Norgate/Henry Holt and Company, London/New York
    • Russell, B.: The Problems of Philosophy. Williams and Norgate/Henry Holt and Company, London/New York (1912)
    • (1912) The Problems of Philosophy
    • Russell, B.1
  • 22
    • 33745886821 scopus 로고    scopus 로고
    • Multi-agent explicit knowledge
    • Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. Springer, Heidelberg
    • Yavorskaya(Sidon), T.: Multi-agent Explicit Knowledge. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.3967, pp. 369-380. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3967 , pp. 369-380
    • Yavorskaya, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.