메뉴 건너뛰기




Volumn 122, Issue 1, 2000, Pages 241-267

Computational complexity of planning and approximate planning in the presence of incompleteness

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

EID: 0034271027     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00043-6     Document Type: Article
Times cited : (106)

References (23)
  • 1
    • 84880654868 scopus 로고    scopus 로고
    • Computational complexity of planning and approximate planning in presence of incompleteness
    • Baral C., Kreinovich V., Trejo R. Computational complexity of planning and approximate planning in presence of incompleteness. Proc. IJCAI-99, Stockholm, Sweden, Vol. 2. 1999;948-953.
    • (1999) Proc. IJCAI-99, Stockholm, Sweden, Vol. 2 , pp. 948-953
    • Baral, C.1    Kreinovich, V.2    Trejo, R.3
  • 2
    • 0003381376 scopus 로고    scopus 로고
    • Approximate reasoning about actions in presence of sensing and incomplete information
    • Baral C., Son T. Approximate reasoning about actions in presence of sensing and incomplete information. Proc. Internat. Logic Programming Symposium (ILPS-97). 1997;387-401.
    • (1997) Proc. Internat. Logic Programming Symposium (ILPS-97) , pp. 387-401
    • Baral, C.1    Son, T.2
  • 4
    • 85031568369 scopus 로고    scopus 로고
    • Formalizing sensing actions: A transition function based approach
    • (to appear)
    • Baral C., Son T. Formalizing sensing actions: A transition function based approach. Artificial Intelligence. 2000;. (to appear).
    • (2000) Artificial Intelligence
    • Baral, C.1    Son, T.2
  • 5
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • Bylander T. The computational complexity of propositional STRIPS planning. Artificial Intelligence. Vol. 69:1994;161-204.
    • (1994) Artificial Intelligence , vol.69 , pp. 161-204
    • Bylander, T.1
  • 6
    • 0029332411 scopus 로고
    • Complexity, decidability and undecidability results for domain-independent planning
    • Erol K., Nau D., Subrahmanian V.S. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence. Vol. 76:(1-2):1995;75-88.
    • (1995) Artificial Intelligence , vol.76 , Issue.12 , pp. 75-88
    • Erol, K.1    Nau, D.2    Subrahmanian, V.S.3
  • 8
    • 0027694534 scopus 로고
    • Representing actions and change by logic programs
    • Gelfond M., Lifschitz V. Representing actions and change by logic programs. J. Logic Programming. Vol. 17:(2-4):1993;301-323.
    • (1993) J. Logic Programming , vol.17 , Issue.24 , pp. 301-323
    • Gelfond, M.1    Lifschitz, V.2
  • 13
    • 0030352324 scopus 로고    scopus 로고
    • What is planning in the presence of sensing?
    • Levesque H. What is planning in the presence of sensing? Proc. AAAI-96, Portland, OR. 1996;1139-1146.
    • (1996) Proc. AAAI-96, Portland, or , pp. 1139-1146
    • Levesque, H.1
  • 15
    • 0031369472 scopus 로고    scopus 로고
    • Probabilistic propositional planning: Representations and complexity
    • Littman M. Probabilistic propositional planning: representations and complexity. Proc. AAAI-97, Providence, RI. 1997;748-754.
    • (1997) Proc. AAAI-97, Providence, RI , pp. 748-754
    • Littman, M.1
  • 16
    • 0001870364 scopus 로고
    • A formal theory of knowledge and action
    • J. Hobbs, & R. Moore. Norwood, NJ: Ablex
    • Moore R. A formal theory of knowledge and action. Hobbs J., Moore R. Formal Theories of the Commonsense World. 1985;Ablex, Norwood, NJ.
    • (1985) Formal Theories of the Commonsense World
    • Moore, R.1
  • 20
    • 0033332766 scopus 로고    scopus 로고
    • Constructing conditional plans by a theorem-prover
    • Rintanen J. Constructing conditional plans by a theorem-prover. J. Artificial Intelligence Res. Vol. 10:1999;323-352.
    • (1999) J. Artificial Intelligence Res. , vol.10 , pp. 323-352
    • Rintanen, J.1
  • 23
    • 0031619007 scopus 로고    scopus 로고
    • Extending GRAPHPLAN to handle uncertainty and sensing actions
    • Weld D., Anderson C., Smith D. Extending GRAPHPLAN to handle uncertainty and sensing actions. Proc. AAAI-98, Madison, WI. 1998;897-904.
    • (1998) Proc. AAAI-98, Madison, WI , pp. 897-904
    • Weld, D.1    Anderson, C.2    Smith, D.3


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