-
1
-
-
0038517219
-
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
-
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
-
3
-
-
26444572401
-
Complexity results for htn planning
-
K. Erol, J. A. Hendler, and D. S. Nau. Complexity Results for HTN Planning. Annals of Mathematics and Artificial Intelligence, 18(1):69-93, 1996.
-
(1996)
Annals of Mathematics and Artificial Intelligence
, vol.18
, Issue.1
, pp. 69-93
-
-
Erol, K.1
Hendler, J.A.2
Nau, D.S.3
-
5
-
-
70350378239
-
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
-
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
-
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
-
8
-
-
84890247844
-
Foundations of a logical approach to agent programming
-
Y. Lespérance, H. J. Levesque, F. Lin, D. Marcu, R. Reiter, and R. B. Scherl. Foundations of a Logical Approach to Agent Programming. In Proc. of Int. Workshop ATAL. 1995.
-
(1995)
Proc. of Int. Workshop ATAL
-
-
Lespérance, Y.1
Levesque, H.J.2
Lin, F.3
Marcu, D.4
Reiter, R.5
Scherl, R.B.6
-
10
-
-
84988613226
-
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
-
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
-
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
-
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
-
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
-
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
-
16
-
-
74449090673
-
On the limits of planning over belief states
-
S. Sardina, G. De Giacomo, Y. Lespérance, and H. J. Levesque. On the Limits of Planning over Belief States. In Proc. of KR, pages 463-471, 2006.
-
(2006)
Proc. of KR
, pp. 463-471
-
-
Sardina, S.1
De Giacomo, G.2
Lespérance, Y.3
Levesque, H.J.4
-
17
-
-
34247261593
-
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
-
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
-
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
|