\begin{thebibliography}{10}

\bibitem{barletta/mark:aaai88}
R.~Barletta and W.~Mark.
\newblock Explanation-based indexing of cases.
\newblock In {\em Proceedings AAAI-88}, 1988.

\bibitem{barrett/weld:systematic}
A.~Barrett and D.~Weld.
\newblock Partial order planning: evaluating possible efficiency gains.
\newblock {\em Artificial Intelligence}, 67:71--112, 1994.

\bibitem{bergmann:PARIS}
R.~Bergmann and W.~Wilke.
\newblock Building and refining abstract planning cases by change of
  representation language.
\newblock {\em Journal of Artificial Intelligence Research}, 3:53--118, 1995.

\bibitem{carbonell:trans}
J.~Carbonell.
\newblock Learning by analogy: Formulating and generalizing plans from past
  experience.
\newblock In R.~Michalski, J.~Carbonell, and T.~Mitchell, editors, {\em Machine
  Learning: an Artificial Intelligence approach}, volume~1. Palo Alto, CA:
  Tioga Press, 1983.

\bibitem{dejong-mooney-ebl-ML}
G.~DeJong and R.~Mooney.
\newblock Explanation-based learning: An alternative view.
\newblock {\em Machine Learning}, 1(2):145--176, 1986.

\bibitem{doorenbos:thesis}
R.~Doorenbos.
\newblock {\em Production Matching for Large Learning Systems}.
\newblock PhD thesis, Computer Science Department, Carnegie Mellon University,
  1995.

\bibitem{fikes/nilsson:strips}
R.~Fikes and N.~Nilsson.
\newblock A new approach to the application of theorem proving to problem
  solving.
\newblock {\em Artificial Intelligence}, 2:189--208, 1971.

\bibitem{fox/leake:ijcai}
S.~Fox and D.~Leake.
\newblock Using introspective reasoning to refine indexing.
\newblock In {\em Proceedings IJCAI-95}, 1995.

\bibitem{francis/ram:utility}
A.~Francis and S.~Ram.
\newblock A comparative utility analysis of case-based reasoning and
  control-rule learning systems.
\newblock In {\em Proceedings of the 8th European Conference on Machine
  Learning, ECML-95}, 1995.

\bibitem{iwasaki/friedland:skeletal}
P.~Friedland and Y.~Iwasaki.
\newblock The concept and implementation of skeletal plans.
\newblock {\em Journal of Automated Reasoning}, 1(2):161--208, 1985.

\bibitem{gratch-composer}
J.~Gratch and G.~DeJong.
\newblock Composer: A probabilistic solution to the utility problem in speed-up
  learning.
\newblock In {\em Proceedings AAAI-92}, 1992.

\bibitem{hammond:aij}
K.~Hammond.
\newblock Explaining and repairing plans that fail.
\newblock {\em Artificial Intelligence}, 45:173--228, 1990.

\bibitem{hanks/weld:spa}
S.~Hanks and D.~Weld.
\newblock A domain-independent algorithm for plan adaptation.
\newblock {\em Journal of Artificial Intelligence Research}, 2:319--360, 1995.

\bibitem{caper}
J.~Hendler, K.~Stoffel, and A.~Mulvehill.
\newblock High performance support for case-based planning applications.
\newblock In {\em Technological Achievements of the Arpa/Rome Laboratory
  Planning Initiative: Advanced Planning Technology}. AAAI Press, 1996.

\bibitem{ihrig/kambhampati:DA}
L.~Ihrig and S.~Kambhampati.
\newblock Derivation replay for partial-order planning.
\newblock In {\em Proceedings AAAI-94}, 1994.

\bibitem{ihrig/kambhampati:JDA}
L~Ihrig and S.~Kambhampati.
\newblock Plan-space vs state-space planning in reuse and replay.
\newblock Technical Report 94-006, Department of Computer Science and
  Engineering, 1994.
\newblock Arizona State University. Also available at
  http://rakaposhi.eas.asu.edu/yochan.html.

\bibitem{ihrig/kambhampati:full}
L.~Ihrig and S.~Kambhampati.
\newblock Design and implementation of a replay framework based on a partial
  order planner.
\newblock In {\em Proceedings AAAI-96}, 1996.

\bibitem{joslin/roach:conjunctive}
D.~Joslin and J.~Roach.
\newblock A theoretical analysis of conjunctive goal problems.
\newblock {\em Artificial Intelligence}, 41:97--106, 1990.

\bibitem{rao-cbr-darpa}
S.~Kambhampati.
\newblock Utility tradeoffs in incremental modification and reuse of plans.
\newblock In {\em Proceedings AAAI Spring Symposium on Computational
  Considerations in Supporting Incremental Modification and Reuse}, 1992.

\bibitem{rao-cij}
S.~Kambhampati.
\newblock Exploiting causal structure to control retrieval and refitting during
  plan reuse.
\newblock {\em Computational Intelligence}, 10, 1994.

\bibitem{kambhampati/chen:aaai}
S.~Kambhampati and J.~Chen.
\newblock Relative utility of ebg based plan reuse in partial ordering vs total
  ordering planning.
\newblock In {\em Proceedings AAAI-93}, pages 514--519, 1993.
\newblock Washington, D.C.

\bibitem{kambhampati/hendler:reuse}
S.~Kambhampati and J.~A. Hendler.
\newblock A validation structure based theory of plan modification and reuse.
\newblock {\em Artificial Intelligence}, 55:193--258, 1992.

\bibitem{kambhampati/ihrig/srivastava:aips}
S.~Kambhampati, L.~Ihrig, and B.~Srivastava.
\newblock A candidate set based analysis of subgoal interactions in conjunctive
  goal planning.
\newblock In {\em Proceedings of the 3rd Intl. Conf. on AI Planning Systems},
  1996.

\bibitem{kambhampati/katukam/yqu:aij}
S.~Kambhampati, S.~Katukam, and Y.~Qu.
\newblock Failure driven dynamic search control for partial order planners: An
  explanation-based approach.
\newblock {\em Artificial Intelligence}, 88:253--315, 1996.

\bibitem{rao-aijdes}
S.~Kambhampati, C.~Knoblock, and Q.~Yang.
\newblock Planning as refinement search: a unified framework for evaluating
  design tradeoffs in partial-order planning.
\newblock {\em Artificial Intelligence}, 76:167--238, 1995.

\bibitem{koehler:aips2}
J.~Koehler.
\newblock Avoiding pitfalls in case-based planning.
\newblock In {\em Proceedings of the 2nd Intl. Conf. on AI Planning Systems},
  1994.

\bibitem{korf:heuristics}
R.~Korf.
\newblock Planning as search: a qualitative approach.
\newblock {\em Artificial Intelligence}, 33:65--68, 1987.

\bibitem{mcallester/rosenblitt:partial}
D.~McAllester and D~Rosenblitt.
\newblock Systematic nonlinear planning.
\newblock In {\em Proceedings AAAI-91}, 1991.

\bibitem{minton-macrops}
S.~Minton.
\newblock Issues in the design of operator composition systems.
\newblock In {\em Proceedings of the International conference on Machine
  Learning}, 1990.

\bibitem{minton:utility}
S.~Minton.
\newblock Quantitative results concerning the utility of explanation-based
  learning.
\newblock {\em Artificial Intelligence}, 42:363--392, 1990.

\bibitem{mostow/bhatnagar:failsafe}
J.~Mostow and N.~Bhatnagar.
\newblock Failsafe: A floor planner that uses ebg to learn from its failures.
\newblock In {\em Proceedings IJCAI-87}, 1987.

\bibitem{munioz:caplan}
H.~Munoz-Avilla and F.~Weberskirch.
\newblock Planning for manufacturing workpieces by storing, indexing and
  replaying planning decisions.
\newblock In {\em Proceedings of the 3rd Intl. Conf. on AI Planning Systems}.
  AAAI-Press, 1996.

\bibitem{munioz:ecp}
H.~Munoz-Avilla and F.~Weberskirch.
\newblock A case study on mergeability of cases with a partial-order planner.
\newblock In {\em Proceedings of the 4th European Conf. on Planning}, 1997.

\bibitem{ram/cox:introspective}
A.~Ram and M.~Cox.
\newblock Introspecive reasoning using meta-explanations for multistrategy
  learning.
\newblock In R.~Michalski and G.~Tecuci, editors, {\em Machine Learning: A
  multistrategy approach Vol. IV}. Morgan Kaufmann, 1994.

\bibitem{ram/francis:mpa}
S.~Ram and A.~Francis.
\newblock Multi-plan retrieval and adaptation in an experience-based agent.
\newblock In David~B. Leake, editor, {\em Case-Based Reasoning: experiences,
  lessons, and future directions}. AAAI Press/The MIT Press, 1996.

\bibitem{redmond:celia}
M.~Redmond.
\newblock Distributed cases for case-based reasoning:facilitating use of
  multiple cases.
\newblock In {\em Proceedings AAAI-90}, 1990.

\bibitem{smyth/keane:ijcai95}
B~Smyth and M~Keane.
\newblock Remembering to forget: A competence-preserving deletion policy for
  cbr.
\newblock In {\em Proceedings IJCAI-95}, 1995.

\bibitem{tambe-utility}
N.~Tambe, A.~Newell, and P.~Rosenbloom.
\newblock The problem of expensive chunks and its solution by restricting
  expressiveness.
\newblock {\em Machine Learning}, 5:299--349, 1990.

\bibitem{tate:nonlin}
A.~Tate.
\newblock Generating project networks.
\newblock In {\em Proceedings IJCAI-77}, 1977.

\bibitem{veloso:deriv}
M.~Veloso.
\newblock {\em Planning and learning by analogical reasoning}.
\newblock Springer Verlag, 1994.
\newblock Number 886 in Lecture Notes in Artificial Intelligence.

\bibitem{veloso/blythe:linkability}
M.~Veloso and J.~Blythe.
\newblock Linkability: Examining causal link commitments in partial-order
  planning.
\newblock In {\em Proceedings of the 2nd Intl. Conf. on AI Planning Systems},
  1994.

\bibitem{veloso/carbonell:ml}
M.~Veloso and J.~Carbonell.
\newblock Derivational analogy in prodigy: Automating case acquisition, storage
  and utilization.
\newblock {\em Machine Learning}, 10:249--278, 1993.

\bibitem{veloso/carbonell:chapter}
M.~Veloso and J~Carbonell.
\newblock Toward scaling up machine learning: A case study with derivational
  analogy in {\sc prodigy}.
\newblock In S.~Minton, editor, {\em Machine Learning methods for planning}.
  Morgan Kaufmann, 1993.

\bibitem{yang/nau/hendler:cij}
Q.~Yang, D.~Nau, and J.~Hendler.
\newblock Merging separately generated plans with restricted interactions.
\newblock {\em Computational Intelligence}, 8(2):648--676, 1992.

\end{thebibliography}
