메뉴 건너뛰기




Volumn 119, Issue 1, 2000, Pages 141-190

Complexity of belief update

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; THEOREM PROVING;

EID: 0033702140     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00016-3     Document Type: Article
Times cited : (22)

References (30)
  • 1
    • 0000128393 scopus 로고
    • On the logic of theory change: Partial meet contraction and revision functions
    • Alchourrón C.E., Gärdenfors P., Makinson D. On the logic of theory change: Partial meet contraction and revision functions. J. Symbolic Logic. Vol. 50:1985;510-530.
    • (1985) J. Symbolic Logic , vol.50 , pp. 510-530
    • Alchourrón, C.E.1    Gärdenfors, P.2    Makinson, D.3
  • 2
    • 0000392346 scopus 로고
    • The complexity of finite functions
    • J. van Leeuwen. Amsterdam: Elsevier Science (North-Holland). Chapter 14
    • Boppana R., Sipser M. The complexity of finite functions. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. A. 1990;Elsevier Science (North-Holland), Amsterdam. Chapter 14.
    • (1990) Handbook of Theoretical Computer Science , vol.A
    • Boppana, R.1    Sipser, M.2
  • 4
    • 0002618729 scopus 로고
    • Generalized update: Belief change in dynamic settings
    • Boutilier C. Generalized update: Belief change in dynamic settings. Proc. IJCAI-95, Montreal, Quebec. 1995;1550-1556.
    • (1995) Proc. IJCAI-95, Montreal, Quebec , pp. 1550-1556
    • Boutilier, C.1
  • 5
    • 0030146995 scopus 로고    scopus 로고
    • Abduction to plausible causes: An event-based model of belief update
    • Boutilier C. Abduction to plausible causes: An event-based model of belief update. Artificial Intelligence. Vol. 83:1996;143-166.
    • (1996) Artificial Intelligence , vol.83 , pp. 143-166
    • Boutilier, C.1
  • 7
    • 85156265719 scopus 로고
    • Investigations into a theory of knowledge base revision: Preliminary report
    • Dalal M. Investigations into a theory of knowledge base revision: Preliminary report. Proc. AAAI-88, St. Paul, MN. 1988;475-479.
    • (1988) Proc. AAAI-88, St. Paul, MN , pp. 475-479
    • Dalal, M.1
  • 8
    • 0026940077 scopus 로고
    • On the complexity of propositional knowledge base revision, updates and counterfactuals
    • Eiter T., Gottlob G. On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence. Vol. 57:1992;227-270.
    • (1992) Artificial Intelligence , vol.57 , pp. 227-270
    • Eiter, T.1    Gottlob, G.2
  • 11
    • 0002122332 scopus 로고
    • Introducing actions into qualitative simulation
    • Forbus K.D. Introducing actions into qualitative simulation. Proc. IJCAI-89, Detroit, MI. 1989;1273-1278.
    • (1989) Proc. IJCAI-89, Detroit, MI , pp. 1273-1278
    • Forbus, K.D.1
  • 15
    • 0001951331 scopus 로고
    • A catalog of complexity classes
    • J. van Leeuwen. Amsterdam: Elsevier Science (North-Holland). Chapter 2
    • Johnson D.S. A catalog of complexity classes. van Leeuwen 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
  • 17
    • 0026383919 scopus 로고
    • Propositional knowledge base revision and minimal change
    • Katsuno H., Mendelzon A.O. Propositional knowledge base revision and minimal change. Artificial Intelligence. Vol. 52:1991;263-294.
    • (1991) Artificial Intelligence , vol.52 , pp. 263-294
    • Katsuno, H.1    Mendelzon, A.O.2
  • 18
    • 0024020188 scopus 로고
    • The complexity of optimization problems
    • Krentel M.V. The complexity of optimization problems. J. Comput. System Sci. Vol. 36:1988;490-509.
    • (1988) J. Comput. System Sci. , vol.36 , pp. 490-509
    • Krentel, M.V.1
  • 21
    • 37349044608 scopus 로고
    • Circumscription - A form of non-monotonic reasoning
    • McCarthy J. Circumscription - A form of non-monotonic reasoning. Artificial Intelligence. Vol. 13:1980;27-39.
    • (1980) Artificial Intelligence , vol.13 , pp. 27-39
    • McCarthy, J.1
  • 24
    • 0002726244 scopus 로고
    • On closed world data bases
    • H. Gallaire, & J. Minker. New York: Plenum
    • Reiter R. On closed world data bases. Gallaire H., Minker J. Logic and Data Bases. 1978;119-140 Plenum, New York.
    • (1978) Logic and Data Bases , pp. 119-140
    • Reiter, R.1
  • 25
    • 0000731447 scopus 로고
    • Ordinal conditional functions: A dynamic theory of epistemic states
    • Dordrecht: Kluwer Academic
    • Spohn W. Ordinal conditional functions: A dynamic theory of epistemic states. Causation in Decision, Belief Change, and Statistics. 1988;105-134 Kluwer Academic, Dordrecht.
    • (1988) Causation in Decision, Belief Change, and Statistics , pp. 105-134
    • Spohn, W.1
  • 27
    • 84985139824 scopus 로고
    • Is belief revision harder than you thought?
    • Winslett M. Is belief revision harder than you thought? Proc. AAAI-86, Philadelphia, PA. 1986;421-427.
    • (1986) Proc. AAAI-86, Philadelphia, PA , pp. 421-427
    • Winslett, M.1
  • 28
    • 85156267281 scopus 로고
    • Reasoning about actions using a possible models approach
    • Winslett M. Reasoning about actions using a possible models approach. Proc. AAAI-88, St. Paul, MN. 1988;89-93.
    • (1988) Proc. AAAI-88, St. Paul, MN , pp. 89-93
    • Winslett, M.1
  • 30
    • 0030370726 scopus 로고    scopus 로고
    • Updating knowledge bases with disjunctive information
    • Zhang Y., Foo N. Updating knowledge bases with disjunctive information. Proc. AAAI-96, Portland, OR. 1996;562-568.
    • (1996) Proc. AAAI-96, Portland, or , pp. 562-568
    • Zhang, Y.1    Foo, N.2


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