메뉴 건너뛰기




Volumn 116, Issue 1-2, 2000, Pages 193-215

On the decidability and complexity of reasoning about only knowing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; KNOWLEDGE REPRESENTATION; POLYNOMIALS;

EID: 0033881953     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00083-1     Document Type: Article
Times cited : (15)

References (28)
  • 1
    • 0028507433 scopus 로고
    • The logic of only knowing as a unified framework for nonmonotonic reasoning
    • Chen J. The logic of only knowing as a unified framework for nonmonotonic reasoning. Fundamenta Informaticae. 21:1994;205-220.
    • (1994) Fundamenta Informaticae , vol.21 , pp. 205-220
    • Chen, J.1
  • 3
    • 0010317071 scopus 로고
    • Reasoning with parsimonious and moderately grounded expansions
    • Eiter T., Gottlob G. Reasoning with parsimonious and moderately grounded expansions. Fundamenta Informaticae. 17:(1, 2):1992;31-54.
    • (1992) Fundamenta Informaticae , vol.17 , Issue.1-2 , pp. 31-54
    • Eiter, T.1    Gottlob, G.2
  • 4
    • 0027608575 scopus 로고
    • Propositional circumscription and extended closed world reasoning are Π^p_2-complete
    • Eiter T., Gottlob G. Propositional circumscription and extended closed world reasoning are Π^p_2 -complete. Theoret. Comput. Sci. 114:1993;231-245.
    • (1993) Theoret. Comput. Sci. , vol.114 , pp. 231-245
    • Eiter, T.1    Gottlob, G.2
  • 5
    • 0000898194 scopus 로고
    • Complexity results for nonmonotonic logics
    • Gottlob G. Complexity results for nonmonotonic logics. J. Logic and Computation. 2:1992;397-425.
    • (1992) J. Logic and Computation , vol.2 , pp. 397-425
    • Gottlob, G.1
  • 6
    • 0029271767 scopus 로고
    • NP trees and Carnap's modal logic
    • Gottlob G. NP trees and Carnap's modal logic. J. ACM. 42:(2):1995;421-457.
    • (1995) J. ACM , vol.42 , Issue.2 , pp. 421-457
    • Gottlob, G.1
  • 7
    • 0029290446 scopus 로고
    • Levesque's axiomatization of only knowing is incomplete
    • Halpern J.Y., Lakemeyer G. Levesque's axiomatization of only knowing is incomplete. Artificial Intelligence. 74:(2):1995;381-387.
    • (1995) Artificial Intelligence , vol.74 , Issue.2 , pp. 381-387
    • Halpern, J.Y.1    Lakemeyer, G.2
  • 9
    • 0040241328 scopus 로고
    • Towards a theory of knowledge and ignorance: Preliminary report
    • K. Apt. Berlin: Springer
    • Halpern J.Y., Moses Y. Towards a theory of knowledge and ignorance: Preliminary report. Apt K. Logic and Models of Concurrent Systems. 1985;Springer, Berlin.
    • (1985) Logic and Models of Concurrent Systems
    • Halpern, J.Y.1    Moses, Y.2
  • 10
    • 0026853865 scopus 로고
    • A guide to completeness and complexity for modal logics of knowledge and belief
    • Halpern J.Y., Moses Y. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence. 54:1992;319-379.
    • (1992) Artificial Intelligence , vol.54 , pp. 319-379
    • Halpern, J.Y.1    Moses, Y.2
  • 11
    • 0001951331 scopus 로고
    • A catalog of complexity classes
    • J. van Leuven. North-Holland, Amsterdam: Elsevier Science. Chapter 2
    • Johnson D.S. A catalog of complexity classes. van Leuven J. Handbook of Theoretical Computer Science, Vol. A. 1990;Elsevier Science, North-Holland, Amsterdam. Chapter 2.
    • (1990) Handbook of Theoretical Computer Science, Vol. A
    • Johnson, D.S.1
  • 12
    • 0043149475 scopus 로고
    • Embedding a default system into nonmonotonic logics
    • Kaminski M. Embedding a default system into nonmonotonic logics. Fundamenta Informaticae. 14:1991;345-354.
    • (1991) Fundamenta Informaticae , vol.14 , pp. 345-354
    • Kaminski, M.1
  • 13
    • 0030196552 scopus 로고    scopus 로고
    • Limited reasoning in first-order knowledge bases with full introspection
    • Lakemeyer G. Limited reasoning in first-order knowledge bases with full introspection. Artificial Intelligence. 84:1996;209-255.
    • (1996) Artificial Intelligence , vol.84 , pp. 209-255
    • Lakemeyer, G.1
  • 17
    • 0021466634 scopus 로고
    • Foundations of a functional approach to knowledge representation
    • Levesque H.J. Foundations of a functional approach to knowledge representation. Artificial Intelligence. 23:1984;155-212.
    • (1984) Artificial Intelligence , vol.23 , pp. 155-212
    • Levesque, H.J.1
  • 18
    • 0025403234 scopus 로고
    • All I know: A study in autoepistemic logic
    • Levesque H.J. All I know: A study in autoepistemic logic. Artificial Intelligence. 42:1990;263-310.
    • (1990) Artificial Intelligence , vol.42 , pp. 263-310
    • Levesque, H.J.1
  • 19
    • 0028524383 scopus 로고
    • Minimal belief and negation as failure
    • Lifschitz V. Minimal belief and negation as failure. Artificial Intelligence. 70:1994;53-72.
    • (1994) Artificial Intelligence , vol.70 , pp. 53-72
    • Lifschitz, V.1
  • 21
    • 0021819131 scopus 로고
    • Semantical considerations on nonmonotonic logic
    • Moore R.C. Semantical considerations on nonmonotonic logic. Artificial Intelligence. 25:1985;75-94.
    • (1985) Artificial Intelligence , vol.25 , pp. 75-94
    • Moore, R.C.1
  • 22
    • 0006460052 scopus 로고
    • On the decidability and complexity of autoepistemic reasoning
    • Niemeläa I. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae. 17:(1, 2):1992;117-156.
    • (1992) Fundamenta Informaticae , vol.17 , Issue.1-2 , pp. 117-156
    • Niemeläa, I.1
  • 23
    • 44049112934 scopus 로고
    • What should a database know?
    • Reiter R. What should a database know? J. Logic Programming. 14:1990;127-153.
    • (1990) J. Logic Programming , vol.14 , pp. 127-153
    • Reiter, R.1
  • 24
    • 0031365713 scopus 로고    scopus 로고
    • Reasoning with minimal belief and negation as failure: Algorithms and complexity
    • Rosati R. Reasoning with minimal belief and negation as failure: Algorithms and complexity. Proc. AAAI-97, Providence, RI. 1997;430-435.
    • (1997) Proc. AAAI-97, Providence, RI , pp. 430-435
    • Rosati, R.1
  • 25
    • 0342283753 scopus 로고    scopus 로고
    • Reasoning about minimal knowledge in nonmonotonic modal logics
    • Rosati R. Reasoning about minimal knowledge in nonmonotonic modal logics. J. Logic, Language and Information. 8:(2):1999;187-203.
    • (1999) J. Logic, Language and Information , vol.8 , Issue.2 , pp. 187-203
    • Rosati, R.1
  • 27
    • 84909925712 scopus 로고
    • Nonmonotonic logics: Meaning and utility
    • Shoham Y. Nonmonotonic logics: Meaning and utility. Proc. IJCAI-87, Milan, Italy :1987;388-392.
    • (1987) Proc. IJCAI-87, Milan, Italy , pp. 388-392
    • Shoham, Y.1


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