메뉴 건너뛰기




Volumn , Issue , 2010, Pages 491-498

Agent programming via planning programs

Author keywords

Agent programming; LTL; Model checking; Planning; Synthesis

Indexed keywords

AGENT PROGRAMMING; CONTROL FLOWS; LTL; PLANNING PROJECTS; REACTIVE SYSTEM;

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

References (20)
  • 1
    • 0038517219 scopus 로고    scopus 로고
    • Weak, strong, and strong cyclic planning via symbolic model checking
    • A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence, 147(1-2):35-84, 2003.
    • (2003) Artificial Intelligence , vol.147 , Issue.1-2 , pp. 35-84
    • Cimatti, A.1    Pistore, M.2    Roveri, M.3    Traverso, P.4
  • 2
    • 78650629662 scopus 로고    scopus 로고
    • Composition of partially observable services exporting their behaviour
    • G. De Giacomo, R. De Masellis, and F. Patrizi. Composition of partially observable services exporting their behaviour. In Proc. of ICAPS'09, 2009.
    • (2009) Proc. of ICAPS'09
    • De Giacomo, G.1    De Masellis, R.2    Patrizi, F.3
  • 5
    • 70350378239 scopus 로고    scopus 로고
    • GOAL as a planning formalism
    • of LNCS. Springer
    • K. V. Hindriks and T. Roberti. GOAL as a planning formalism. In Proc. of MATES, volume 5774 of LNCS, pages 29-40. Springer, 2009.
    • (2009) Proc. of MATES , vol.5774 , pp. 29-40
    • Hindriks, K.V.1    Roberti, T.2
  • 6
    • 31644433450 scopus 로고    scopus 로고
    • Analyzing LTL model checking techniques for plan synthesis and controller synthesis (work in progress)
    • S. Kerjean, F. Kabanza, R. St.-Denis, and S. Thiébaux. Analyzing LTL model checking techniques for plan synthesis and controller synthesis (work in progress). Electronic Notes Theoretical Comput. Science, 149(2):91-104, 2006.
    • (2006) Electronic Notes Theoretical Comput. Science , vol.149 , Issue.2 , pp. 91-104
    • Kerjean, S.1    Kabanza, F.2    St.-Denis, R.3    Thiébaux, S.4
  • 7
    • 33750319541 scopus 로고    scopus 로고
    • Synthesis with incomplete information
    • D. G. Howard Barringer, Michael Fisher and G. Gough, editors,. Kluwer Academic Publishers, Jan
    • O. Kupferman and M. Y. Vardi. Synthesis with incomplete information. In D. G. Howard Barringer, Michael Fisher and G. Gough, editors, Advances in Temporal Logic, pages 109-127. Kluwer Academic Publishers, Jan. 2000.
    • (2000) Advances in Temporal Logic , pp. 109-127
    • Kupferman, O.1    Vardi, M.Y.2
  • 10
    • 84988613226 scopus 로고
    • An algebraic definition of simulation between programs
    • R. Milner. An algebraic definition of simulation between programs. In Proc. of IJCAI, pages 481-489, 1971.
    • (1971) Proc. of IJCAI , pp. 481-489
    • Milner, R.1
  • 11
    • 33745649604 scopus 로고    scopus 로고
    • Synthesis of reactive(1) designs
    • N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of Reactive(1) Designs. In VMCAI, pages 364-380, 2006.
    • (2006) VMCAI , pp. 364-380
    • Piterman, N.1    Pnueli, A.2    Sa'ar, Y.3
  • 12
    • 0024864157 scopus 로고
    • On the synthesis of a reactive module
    • A. Pnueli and R. Rosner. On the Synthesis of a Reactive Module. In Proc. of POPL, pages 179-190, 1989.
    • (1989) Proc. of POPL , pp. 179-190
    • Pnueli, A.1    Rosner, R.2
  • 13
    • 84948966261 scopus 로고    scopus 로고
    • Agentspeak(L): BDI agents speak out in a logical computable language
    • of LNCS,. Springer
    • A. S. Rao. Agentspeak(L): BDI agents speak out in a logical computable language. In Proc. of MAAMAW, volume 1038 of LNCS, pages 42-55. Springer, 1996.
    • (1996) Proc. of MAAMAW , vol.1038 , pp. 42-55
    • Rao, A.S.1
  • 14
    • 13444301648 scopus 로고    scopus 로고
    • Complexity of planning with partial observability
    • J. Rintanen. Complexity of planning with partial observability. In Proc. of ICAPS, pages 345-354, 2004.
    • (2004) Proc. of ICAPS , pp. 345-354
    • Rintanen, J.1
  • 15
    • 58849103582 scopus 로고    scopus 로고
    • Realizing multiple autonomous agents through scheduling of shared devices
    • S. Sardina and G. De Giacomo. Realizing multiple autonomous agents through scheduling of shared devices. In Proc. of ICAPS, pages 304-312, 2008.
    • (2008) Proc. of ICAPS , pp. 304-312
    • Sardina, S.1    De Giacomo, G.2
  • 17
    • 34247261593 scopus 로고    scopus 로고
    • Hierarchical planning in BDI agent programming languages: A formal approach
    • S. Sardina, L. P. de Silva, and L. Padgham. Hierarchical planning in BDI agent programming languages: A formal approach. In Proc. of AAMAS, pages 1001-1008, 2006.
    • (2006) Proc. of AAMAS , pp. 1001-1008
    • Sardina, S.1    De Silva, L.P.2    Padgham, L.3
  • 19
    • 33744737475 scopus 로고    scopus 로고
    • Semantics of declarative goals in agent programming
    • B. van Riemsdijk, M. Dastani, and J.-J. Meyer. Semantics of declarative goals in agent programming. In Proc. of AAMAS, pages 133-140, 2005.
    • (2005) Proc. of AAMAS , pp. 133-140
    • Van Riemsdijk, B.1    Dastani, M.2    Meyer, J.-J.3
  • 20
    • 84947731286 scopus 로고    scopus 로고
    • An automata-theoretic approach to linear temporal logic
    • of LNCS
    • M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, volume 1043 of LNCS, pages 238-266, 1996.
    • (1996) Logics for Concurrency: Structure Versus Automata , vol.1043 , pp. 238-266
    • Vardi, M.Y.1


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