메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 1211-1216

Conformant planning for domains with constraints - A new approach

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BENCHMARKING; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS;

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

References (19)
  • 1
    • 0344674971 scopus 로고    scopus 로고
    • Reasoning agents in dynamic domains
    • Minker, J,. ed.
    • Baral, C.; and Gelfond, M. 2000. Reasoning agents in dynamic domains. In Minker, J,. ed., LBAI, 257-279.
    • (2000) LBAI , pp. 257-279
    • Baral, C.1    Gelfond, M.2
  • 2
    • 0034271027 scopus 로고    scopus 로고
    • Computational complexity of planning and approximate planning in the presence of incompleteness
    • Baral, C.; Kreinovich, V.; and Trejo, R. 2000. Computational complexity of planning and approximate planning in the presence of incompleteness. AIJ 122:241-267.
    • (2000) AIJ , vol.122 , pp. 241-267
    • Baral, C.1    Kreinovich, V.2    Trejo, R.3
  • 4
    • 13444256696 scopus 로고    scopus 로고
    • Conformant planning via heuristic forward search: A new approach
    • Brafman, R., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. ICAPS-04, 355-364.
    • (2004) ICAPS-04 , pp. 355-364
    • Brafman, R.1    Hoffmann, J.2
  • 5
    • 13444312257 scopus 로고    scopus 로고
    • Heuristic guidance measures for conformant planning
    • Bryce, D., and Kambhampati, S. 2004. Heuristic Guidance Measures for Conformant Planning. ICAPS-04, 365-375.
    • (2004) ICAPS-04 , pp. 365-375
    • Bryce, D.1    Kambhampati, S.2
  • 6
    • 0037503164 scopus 로고    scopus 로고
    • SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
    • Castellini, C.; Giunchiglia, E.; and Tacchella, A. 2003. SAT-based Planning in Complex Domains: Concurrency, Constraints and Nondeterminism. AIJ 147:85-117.
    • (2003) AIJ , vol.147 , pp. 85-117
    • Castellini, C.1    Giunchiglia, E.2    Tacchella, A.3
  • 7
    • 0013365496 scopus 로고    scopus 로고
    • Conformant planning via symbolic model checking
    • Cimatti, A., and Roveri, M. 2000. Conformant Planning via Symbolic Model Checking. JAIR 13:305-338.
    • (2000) JAIR , vol.13 , pp. 305-338
    • Cimatti, A.1    Roveri, M.2
  • 8
    • 4644364683 scopus 로고    scopus 로고
    • Conformant planning via symbolic model checking and heuristic search
    • Cimatti, A. et al. 2004. Conformant Planning via Symbolic Model Checking and Heuristic Search. AIJ 159:127-206.
    • (2004) AIJ , vol.159 , pp. 127-206
    • Cimatti, A.1
  • 9
    • 0037372121 scopus 로고    scopus 로고
    • κ system
    • κ System. AIJ 144, 157-211.
    • (2003) AIJ , vol.144 , pp. 157-211
    • Eiter, T.1
  • 10
  • 11
    • 0038595412 scopus 로고    scopus 로고
    • Fragment-based conformant planning
    • Kurien, J.; Nayak, P. P.; and Smith, D. E. 2002. Fragment-based conformant planning. In AIPS, 153-162.
    • (2002) AIPS , pp. 153-162
    • Kurien, J.1    Nayak, P.P.2    Smith, D.E.3
  • 12
    • 85168160290 scopus 로고    scopus 로고
    • A causal theory of ramifications and qualifications
    • 95
    • McCain, N., and Turner, H. 95. A causal theory of ramifications and qualifications. IJCAI, 1978-1984.
    • IJCAI , pp. 1978-1984
    • McCain, N.1    Turner, H.2
  • 13
    • 85093865817 scopus 로고    scopus 로고
    • A knowledge-based approach to planning with incomplete information and sensing
    • Petrick, R., and Bacchus, F. 2002. A knowledge-based approach to planning with incomplete information and sensing. AIPS-02, 212-222.
    • (2002) AIPS-02 , pp. 212-222
    • Petrick, R.1    Bacchus, F.2
  • 14
    • 0033332766 scopus 로고    scopus 로고
    • Constructing conditional plans by a theorem proven
    • Rintanen, J. 2000. Constructing conditional plans by a theorem proven JAIR 10:323-352.
    • (2000) JAIR , vol.10 , pp. 323-352
    • Rintanen, J.1
  • 15
    • 0000716077 scopus 로고    scopus 로고
    • Conformant Graphplan
    • Smith, D. & Weld, D. 1998. Conformant Graphplan. AAAI.
    • (1998) AAAI
    • Smith, D.1    Weld, D.2
  • 16
    • 0035124264 scopus 로고    scopus 로고
    • Formalizing sensing actions - A transition function based approach
    • Son, T., and Baral, C. 2001. Formalizing sensing actions - a transition function based approach. AIJ 125(1-2):19-91.
    • (2001) AIJ , vol.125 , Issue.1-2 , pp. 19-91
    • Son, T.1    Baral, C.2
  • 17
    • 9444236179 scopus 로고    scopus 로고
    • Planning with sensing actions and incomplete information using logic programming
    • Son, T. et al. 2004. Planning with Sensing Actions and Incomplete Information using Logic Programming. LPNMR, 261-274.
    • (2004) LPNMR , pp. 261-274
    • Son, T.1
  • 19
    • 77952044626 scopus 로고    scopus 로고
    • Polynomial-length planning spans the polynomial hierarchy
    • Turner, H. 2002. Polynomial-length planning spans the polynomial hierarchy. JELIA'02, 111-124.
    • (2002) JELIA'02 , pp. 111-124
    • Turner, H.1


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