메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 58-63

Prepositional planning in BDI agents

Author keywords

BDI; Propositional Planning; X BDI

Indexed keywords

ABSTRACTING; ALGORITHMS; CONTROLLABILITY; GRAPH THEORY; PRODUCTION CONTROL; SOFTWARE AGENTS; STRATEGIC PLANNING;

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

References (29)
  • 6
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 7
    • 0023381915 scopus 로고
    • Planning for conjunctive goals
    • D. Chapman. Planning for conjunctive goals. Artificial Intelligence, 32(3):333-377, 1987.
    • (1987) Artificial Intelligence , vol.32 , Issue.3 , pp. 333-377
    • Chapman, D.1
  • 8
    • 0025403233 scopus 로고
    • Intention is choice with commitment
    • P. R. Cohen and H. J. Levesque. Intention is choice with commitment. Artificial Intelligence, 42(2-3):213-261, 1990.
    • (1990) Artificial Intelligence , vol.42 , Issue.2-3 , pp. 213-261
    • Cohen, P.R.1    Levesque, H.J.2
  • 10
    • 0032090125 scopus 로고    scopus 로고
    • Engineering agentspeak(L): A formal computational model
    • M. d'Inverno and M. Luck. Engineering AgentSpeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233-260, 1998.
    • (1998) Journal of Logic and Computation , vol.8 , Issue.3 , pp. 233-260
    • D'Inverno, M.1    Luck, M.2
  • 11
    • 84889187007 scopus 로고
    • An architecture for real-time reasoning and system control
    • F. F. Ingrand, M. P. Georgeff, and A. S. Rao. An architecture for real-time reasoning and system control. IEEE Expert, 7(6):33-44, 1992.
    • (1992) IEEE Expert , vol.7 , Issue.6 , pp. 33-44
    • Ingrand, F.F.1    Georgeff, M.P.2    Rao, A.S.3
  • 12
    • 0033904095 scopus 로고    scopus 로고
    • On agent-based software engineering
    • N. R. Jennings. On agent-based software engineering. Artificial Intelligence, 117:277-296, 2000.
    • (2000) Artificial Intelligence , vol.117 , pp. 277-296
    • Jennings, N.R.1
  • 13
    • 0002303187 scopus 로고
    • Planning as satisfiability
    • Wiley
    • H. Kautz and B. Selman. Planning as satisfiability. In Proc. of the 10th ECAI, pages 359-363, 1992. Wiley.
    • (1992) Proc. of the 10th ECAI , pp. 359-363
    • Kautz, H.1    Selman, B.2
  • 14
    • 0010312817 scopus 로고    scopus 로고
    • Solving complex planning tasks through extraction of subproblems
    • R. Simmons, M. Veloso, and S. Smith, editors. AAAI Press.
    • J. Köhler. Solving complex planning tasks through extraction of subproblems. In R. Simmons, M. Veloso, and S. Smith, editors, Proc. of the 4th AIPS, pages 62-69, 1998. AAAI Press.
    • (1998) Proc. of the 4th AIPS , pp. 62-69
    • Köhler, J.1
  • 18
    • 85166179169 scopus 로고    scopus 로고
    • Automatic synthesis and use of generic types in planning
    • S. Chien, S. Kambhampati, and C. A. Knoblock, editors. AAAI Press
    • D. Long and M. Fox. Automatic synthesis and use of generic types in planning. In S. Chien, S. Kambhampati, and C. A. Knoblock, editors, Proc. of the 5th AIPS, pages 196-205, 2000. AAAI Press.
    • (2000) Proc. of the 5th AIPS , pp. 196-205
    • Long, D.1    Fox, M.2
  • 20
    • 14344285181 scopus 로고    scopus 로고
    • On the compilability and expressive power of propositional planning formalisms
    • B. Nebel. On the compilability and expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research (JAIR), 12:271-315, 2000.
    • (2000) Journal of Artificial Intelligence Research (JAIR) , vol.12 , pp. 271-315
    • Nebel, B.1
  • 21
    • 0036355371 scopus 로고    scopus 로고
    • Deduction systems for BDI logics using sequent calculus
    • ACM Press
    • N. Nide and S. Takata. Deduction systems for BDI logics using sequent calculus. In Proc. of the AAMAS, pages 928-935. ACM Press, 2002.
    • (2002) Proc. of the AAMAS , pp. 928-935
    • Nide, N.1    Takata, S.2
  • 22
    • 0004725654 scopus 로고
    • Formal models and decision procedures for multi-agent systems
    • AAII. Technical Note
    • A. S. Rao and M. P. Georgeff. Formal models and decision procedures for multi-agent systems. Technical Report 61, AAII, 1995. Technical Note.
    • (1995) Technical Report , vol.61
    • Rao, A.S.1    Georgeff, M.P.2
  • 24
    • 84880691938 scopus 로고    scopus 로고
    • Temporal planning with mutual exclusion reasoning
    • D. E. Smith and D. S. Weld. Temporal planning with mutual exclusion reasoning. In Proc. of the 17th IJCAI, pages 326-337, 1999.
    • (1999) Proc. of the 17th IJCAI , pp. 326-337
    • Smith, D.E.1    Weld, D.S.2
  • 25
  • 26
    • 0031144006 scopus 로고    scopus 로고
    • Why interaction is more powerful than algorithms
    • P. Wegner. Why interaction is more powerful than algorithms. Comm. of the ACM, 40(5):80-91, 1997.
    • (1997) Comm. of the ACM , vol.40 , Issue.5 , pp. 80-91
    • Wegner, P.1
  • 27
    • 0032633177 scopus 로고    scopus 로고
    • Recent advances in AI planning
    • D. S. Weld. Recent advances in AI planning. AI Magazine, 20(2):93-123, 1999.
    • (1999) AI Magazine , vol.20 , Issue.2 , pp. 93-123
    • Weld, D.S.1
  • 28
    • 84962076667 scopus 로고    scopus 로고
    • The computational complexity of agent design problems
    • E. Durfee, editor. IEEE Press
    • M. Wooldridge. The computational complexity of agent design problems. In E. Durfee, editor, Proc. of the 4th ICMAS, pages 341-348. IEEE Press, 2000.
    • (2000) Proc. of the 4th ICMAS , pp. 341-348
    • Wooldridge, M.1


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