메뉴 건너뛰기




Volumn , Issue , 2004, Pages 587-597

A Logic of Limited Belief for Reasoning with Disjunctive Information

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

EID: 85167394386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (31)

References (27)
  • 3
    • 21444446907 scopus 로고    scopus 로고
    • On the complexity of entailment in propositional multivalued logics
    • Cadoli, M., and Schaerf, M. 1996. On the complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence 18(1):29-50.
    • (1996) Annals of Mathematics and Artificial Intelligence , vol.18 , Issue.1 , pp. 29-50
    • Cadoli, M.1    Schaerf, M.2
  • 4
    • 0031645259 scopus 로고    scopus 로고
    • A non-deterministic semantics for tractable inference
    • Crawford, J., and Etherington, D. 1998. A non-deterministic semantics for tractable inference. In Proc. of AAAI-98, 286-291.
    • (1998) Proc. of AAAI-98 , pp. 286-291
    • Crawford, J.1    Etherington, D.2
  • 5
    • 0343106137 scopus 로고
    • Towards a theory of access limited reasoning
    • Crawford, J., and Kuipers, B. 1989. Towards a theory of access limited reasoning. In Proc. of KR-89, 67-78.
    • (1989) Proc. of KR-89 , pp. 67-78
    • Crawford, J.1    Kuipers, B.2
  • 7
    • 84990553266 scopus 로고
    • A framework for logics of explicit belief
    • Delgrande, J. 1995. A framework for logics of explicit belief. Computational Intelligence 11(1):47-88.
    • (1995) Computational Intelligence , vol.11 , Issue.1 , pp. 47-88
    • Delgrande, J.1
  • 8
    • 0007912444 scopus 로고
    • Intuitive semantics for first-degree entailments and coupled trees
    • Dunn, J. 1976. Intuitive semantics for first-degree entailments and coupled trees. Philosophical Studies 29:149-168.
    • (1976) Philosophical Studies , vol.29 , pp. 149-168
    • Dunn, J.1
  • 9
    • 0023842375 scopus 로고
    • Belief, awareness, and limited reasoning
    • Fagin, R., and Halpern, J. 1988. Belief, awareness, and limited reasoning. Artificial Intelligence 34(1):39-76.
    • (1988) Artificial Intelligence , vol.34 , Issue.1 , pp. 39-76
    • Fagin, R.1    Halpern, J.2
  • 11
    • 84990624357 scopus 로고
    • Inference without chaining
    • Frisch, A. 1987. Inference without chaining. In Proc. of IJCAI-87, 515-519.
    • (1987) Proc. of IJCAI-87 , pp. 515-519
    • Frisch, A.1
  • 12
    • 0026853865 scopus 로고
    • A guide to completeness and complexity for modal logics of knowledge and belief
    • Halpern, J., and Moses, Y. 1992. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54(3):319-379.
    • (1992) Artificial Intelligence , vol.54 , Issue.3 , pp. 319-379
    • Halpern, J.1    Moses, Y.2
  • 15
    • 0002977725 scopus 로고
    • A completeness theorem in modal logic
    • Kripke, S. 1959. A completeness theorem in modal logic. Journal of Symbolic Logic 24:1-14.
    • (1959) Journal of Symbolic Logic , vol.24 , pp. 1-14
    • Kripke, S.1
  • 16
    • 0040369854 scopus 로고
    • Is there a problem with substitutional quantification?
    • Evans, G., and McDowell, J., eds., Clarendon Press, Oxford
    • Kripke, S. 1976. Is there a problem with substitutional quantification? In Evans, G., and McDowell, J., eds., Truth and Meaning. Clarendon Press, Oxford. 325-419.
    • (1976) Truth and Meaning , pp. 325-419
    • Kripke, S.1
  • 17
    • 29344448462 scopus 로고    scopus 로고
    • Evaluation-based reasoning with disjunctive information in first-order knowledge bases
    • Lakemeyer, G., and Levesque, H. 2002. Evaluation-based reasoning with disjunctive information in first-order knowledge bases. In Proc. of KR-02, 73-81.
    • (2002) Proc. of KR-02 , pp. 73-81
    • Lakemeyer, G.1    Levesque, H.2
  • 19
    • 0020979435 scopus 로고
    • A logic of implicit and explicit belief
    • Levesque, H. 1984. A logic of implicit and explicit belief. In Proc. of AAAI-84, 198-202.
    • (1984) Proc. of AAAI-84 , pp. 198-202
    • Levesque, H.1
  • 20
    • 0010316909 scopus 로고    scopus 로고
    • A completeness result for reasoning with incomplete first-order knowledge bases
    • Levesque, H. 1998. A completeness result for reasoning with incomplete first-order knowledge bases. In Proc. KR-98, 14-23.
    • (1998) Proc. KR-98 , pp. 14-23
    • Levesque, H.1
  • 21
    • 9444269097 scopus 로고    scopus 로고
    • A tractability result for reasoning with incomplete first-order knowledge bases
    • Liu, Y., and Levesque, H. 2003. A tractability result for reasoning with incomplete first-order knowledge bases. In Proc. of IJCAI-03, 83-88.
    • (2003) Proc. of IJCAI-03 , pp. 83-88
    • Liu, Y.1    Levesque, H.2
  • 22
    • 85167452045 scopus 로고    scopus 로고
    • Ph.D. Dissertation, Department of Computer Science, University of Torono preparation
    • Liu, Y. 2004. Ph.D. Dissertation, Department of Computer Science, University of Torono. In preparation.
    • (2004)
    • Liu, Y.1
  • 23
    • 0027574520 scopus 로고
    • Taxonomic syntax for first order inference
    • McAllester, D., and Givan, B. 1993. Taxonomic syntax for first order inference. Journal of the ACM 40(2):246-283.
    • (1993) Journal of the ACM , vol.40 , Issue.2 , pp. 246-283
    • McAllester, D.1    Givan, B.2
  • 24
  • 25
    • 18644381556 scopus 로고
    • A decidable first-order logic for knowledge representation
    • Patel-Schneider, P. 1985. A decidable first-order logic for knowledge representation. In Proc. of IJCAI-85, 455-458.
    • (1985) Proc. of IJCAI-85 , pp. 455-458
    • Patel-Schneider, P.1
  • 26
    • 0029290445 scopus 로고
    • Tractable reasoning via approximation
    • Schaerf, M., and Cadoli, M. 1995. Tractable reasoning via approximation. Artificial Intelligence 74:249-310.
    • (1995) Artificial Intelligence , vol.74 , pp. 249-310
    • Schaerf, M.1    Cadoli, M.2


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