메뉴 건너뛰기




Volumn , Issue , 1998, Pages 44-53

Conditional Effects in Graphplan

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

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

References (13)
  • 1
    • 0001657540 scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proc. 11th Int. Joint Conf. AI, 1636-1642.
    • (1995) Proc. 11th Int. Joint Conf. AI , pp. 1636-1642
    • Blum, A.1    Furst, M.2
  • 2
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. J. Artificial Intelligence 90(1-2):281-300.
    • (1997) J. Artificial Intelligence , vol.90 , Issue.1-2 , pp. 281-300
    • Blum, A.1    Furst, M.2
  • 6
    • 0030352389 scopus 로고    scopus 로고
    • Pushing the envelope: Planning, propositional logic, and stochastic search
    • Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. 13th Nat. Conf. AI, 1194-1201.
    • (1996) Proc. 13th Nat. Conf. AI , pp. 1194-1201
    • Kautz, H.1    Selman, B.2
  • 13
    • 0028750404 scopus 로고
    • An intxoduction to least-commitment planning
    • Weld, D. 1994. An intxoduction to least-commitment planning. AI Magazine 27-61. Available at htp://htp. - ca.washington. edu/pub/ai/.
    • (1994) AI Magazine , pp. 27-61
    • Weld, D.1


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