메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1955-1961

On the decidability of HTN planning with task insertion

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; COMPLEXITY BOUNDS; EXISTENCE PROBLEMS; HIERARCHICAL TASK NETWORK (HTN) PLANNING; HTN PLANNING; ORDERING CONSTRAINTS; STATE-BASED PLANNING;

EID: 84864996249     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-327     Document Type: Conference Paper
Times cited : (91)

References (8)
  • 2
    • 0029332411 scopus 로고
    • Complexity, decidability and undecidability results for domain-independent planning
    • Kutluhan Erol, Dana S. Nau, and V. S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76:75-88, 1995.
    • (1995) Artificial Intelligence , vol.76 , pp. 75-88
    • Erol, K.1    Nau, D.S.2    Subrahmanian, V.S.3


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