-
1
-
-
0001657540
-
Fast planning through planning graph analysis
-
Blum, B., and Fürst, M. L. 1995. Fast planning through planning graph analysis. In PTOC. of IJCAI-95 ,1636-1642.
-
(1995)
PTOC. of IJCAI-95
, pp. 1636-1642
-
-
Blum, B.1
Fürst, M. L.2
-
2
-
-
85097055030
-
TRAINS-95: Towards a mixed-initiative planning assistant
-
AAAI/MIT Press
-
Ferguson, G., and Allen, J. 1996. TRAINS-95: Towards a mixed-initiative planning assistant. In In Proc. of AIPS-96, 70-77. AAAI/MIT Press.
-
(1996)
Proc. of AIPS-96
, pp. 70-77
-
-
Ferguson, G.1
Allen, J.2
-
3
-
-
0006708053
-
Arguing about plans: Plan representation and reasoning for mixed-initiative planning
-
AAAI/MIT Press
-
Ferguson, G., and Allen, J. F. 1994. Arguing about plans: Plan representation and reasoning for mixed-initiative planning. In Proc. of AIPS-94, 13-15. AAAI/MIT Press.
-
(1994)
Proc. of AIPS-94
, pp. 13-15
-
-
Ferguson, G.1
Allen, J. F.2
-
4
-
-
85166244977
-
Fast planning through greedy action graphs
-
Gerevini, A., and Serina, I. 1999. Fast planning through greedy action graphs. In Proc. of AAAI-99, 503 510.
-
(1999)
Proc. of AAAI-99
, pp. 503510
-
-
Gerevini, A.1
Serina, I.2
-
5
-
-
85166211010
-
Plan generation and adaptation using local search techniques for planning graphs
-
Gerevini, A., and Serina, I. 1999a. Plan generation and adaptation using local search techniques for planning graphs. In Proc. of CP-AI-OR-99.
-
(1999)
Proc. of CP-AI-OR-99
-
-
Gerevini, A.1
Serina, I.2
-
6
-
-
0000487049
-
A domain-independent algorithm for plan adaptation
-
Hanks, S., and Weld, D.S. 1995. A domain-independent algorithm for plan adaptation. JAIR, 2: 319-360.
-
(1995)
JAIR
, vol.2
, pp. 319-360
-
-
Hanks, S.1
Weld, D.S.2
-
7
-
-
0026880070
-
A validation-structure-based theory of plan modification and reuse
-
Kambhampati, S., and Hendler, J.A. 1992. A validation-structure-based theory of plan modification and reuse. Artificial Intelligence, 55: 193-258.
-
(1992)
Artificial Intelligence
, vol.55
, pp. 193-258
-
-
Kambhampati, S.1
Hendler, J.A.2
-
8
-
-
0002529410
-
Pushing the envelope: Planning, propositional logic, and stochastic search
-
Portland, OR. AAAI/MIT Press
-
Kautz. H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. of AAAI-96, Portland, OR. AAAI/MIT Press.
-
(1996)
Proc. of AAAI-96
-
-
Kautz., H.1
Selman, B.2
-
9
-
-
84880681440
-
Unifying sat-based and graph-based planning
-
Kautz, H., and Selman, B. 1999. Unifying sat-based and graph-based planning. In Proc. of IJCAI-99.
-
(1999)
Proc. of IJCAI-99
-
-
Kautz, H.1
Selman, B.2
-
10
-
-
84898681853
-
Extending planning graphs to an ADL subset
-
Springer Verlag
-
Koehler, J ., Nebel, B., Hoffmann, J ., and Dimopoulos, Y. 1997. Extending planning graphs to an ADL subset. In Proc. of ECP-97, 273-285. Springer Verlag.
-
(1997)
Proc. of ECP-97
, pp. 273-285
-
-
Koehler, J1
Nebel, B.2
Hoffmann, J3
Dimopoulos, Y.4
-
11
-
-
0029332315
-
Plan reuse versus plan generation: A complexity-theoretic perspective
-
J
-
Nebel, B., and Koehler. J. 1995. Plan reuse versus plan generation: A complexity-theoretic perspective. Artificial Intelligence, 76:427-454.
-
(1995)
Artificial Intelligence
, vol.76
, pp. 427-454
-
-
Nebel, B.1
Koehler2
|