\begin{thebibliography}{}

\bibitem[\protect\BCAY{Bacchus}{Bacchus}{2001}]{ipc2results}
Bacchus, F. \BBOP2001\BBCP.
\newblock \BBOQ The aips '00 planning competition.\BBCQ\
\newblock {\Bem AI Magazine}, {\Bem 22\/}(3), 47--56.

\bibitem[\protect\BCAY{Blum\ \BBA\ Furst}{Blum\ \BBA\ Furst}{1995}]{blum95fast}
Blum, A.\BBACOMMA\  \BBA\ Furst, M. \BBOP1995\BBCP.
\newblock \BBOQ Fast planning through planning graph analysis\BBCQ\
\newblock In {\Bem Proceedings of the Fourteenth International Joint Conference
  on Artificial Inteligence ({IJCAI}-95)}, \BPGS\ 1636--1642.

\bibitem[\protect\BCAY{Bonet\ \BBA\ Geffner}{Bonet\ \BBA\ Geffner}{2000}]{hsp}
Bonet, B.\BBACOMMA\  \BBA\ Geffner, H. \BBOP2000\BBCP.
\newblock \BBOQ {HSP}: Heuristic search planner\BBCQ\
\newblock {\Bem {AI} Magazine}, {\Bem 21\/}(2).

\bibitem[\protect\BCAY{Botea, Enzenberger, Muller,\ \BBA\ Schaeffer}{Botea
  et~al.}{2005}]{macroff}
Botea, A., Enzenberger, M., Muller, M., \BBA\ Schaeffer, J. \BBOP2005\BBCP.
\newblock \BBOQ Macro-{FF}: Improving {AI} planning with automatically learned
  macro-operators\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 24},
  581--621.

\bibitem[\protect\BCAY{Dawson\ \BBA\ Siklossy}{Dawson\ \BBA\
  Siklossy}{1977}]{Dawson:77IJ}
Dawson, C.\BBACOMMA\  \BBA\ Siklossy, L. \BBOP1977\BBCP.
\newblock \BBOQ The role of preprocessing in problem solving systems\BBCQ\
\newblock In {\Bem Proceedings of the Fifth International Joint Conference on
  Artificial Intelligence, ({IJCAI}-77)}, \BPGS\ 465--471.

\bibitem[\protect\BCAY{Fikes\ \BBA\ Nilsson}{Fikes\ \BBA\
  Nilsson}{1971}]{strips}
Fikes, R.\BBACOMMA\  \BBA\ Nilsson, N. \BBOP1971\BBCP.
\newblock \BBOQ {STRIPS}: A new approach to the application of theorem proving
  to problem solving\BBCQ\
\newblock In {\Bem Proceedings of the 2nd International Joint Conference on
  Artificial Intelligence ({IJCAI}-71)}, \BPGS\ 608--620.

\bibitem[\protect\BCAY{Gazen\ \BBA\ Knoblock}{Gazen\ \BBA\
  Knoblock}{1997}]{gazen97combining}
Gazen, B.\BBACOMMA\  \BBA\ Knoblock, C. \BBOP1997\BBCP.
\newblock \BBOQ Combining the expressivity of {UCPOP} with the efficiency of
  {Graphplan}\BBCQ\
\newblock In {\Bem Proceedings of the Fourth European Conference on Planning
  (ECP-97)}, \BPGS\ 221--233.

\bibitem[\protect\BCAY{Helmert}{Helmert}{2004}]{malte}
Helmert, M. \BBOP2004\BBCP.
\newblock \BBOQ A planning heuristic based on causal graph analysis\BBCQ\
\newblock In {\Bem Proceedings of the Fourteenth International Conference on
  Automated Planning and Scheduling ({ICAPS}-04)}, \BPGS\ 161--170.

\bibitem[\protect\BCAY{Helmert}{Helmert}{2006}]{downward}
Helmert, M. \BBOP2006\BBCP.
\newblock \BBOQ The fast downward planning system\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 26},
  191--246.

\bibitem[\protect\BCAY{Hoffmann\ \BBA\ Edelkamp}{Hoffmann\ \BBA\
  Edelkamp}{2005}]{edelkamphoffmann2005}
Hoffmann, J.\BBACOMMA\  \BBA\ Edelkamp, S. \BBOP2005\BBCP.
\newblock \BBOQ The deterministic part of {IPC}-4: An overview\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 24},
  519--579.

\bibitem[\protect\BCAY{Hoffmann\ \BBA\ Nebel}{Hoffmann\ \BBA\
  Nebel}{2001}]{hoffmannnebeljair01}
Hoffmann, J.\BBACOMMA\  \BBA\ Nebel, B. \BBOP2001\BBCP.
\newblock \BBOQ The {FF} planning system: Fast plan generation through
  heuristic search\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 14},
  253--302.

\bibitem[\protect\BCAY{Hoffmann}{Hoffmann}{2001}]{hoffmannijcai01}
Hoffmann, J. \BBOP2001\BBCP.
\newblock \BBOQ Local search topology in planning benchmarks: An empirical
  analysis\BBCQ\
\newblock In {\Bem Proceedings of the Seventeenth International Joint
  Conference on Artificial Intelligence ({IJCAI}-01)}, \BPGS\ 453--458.

\bibitem[\protect\BCAY{Hoffmann}{Hoffmann}{2005}]{hoffmann:jair-05}
Hoffmann, J. \BBOP2005\BBCP.
\newblock \BBOQ Where `ignoring delete lists' works: Local search topology in
  planning benchmarks\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 24},
  685--758.

\bibitem[\protect\BCAY{Koehler, Nebel, Hoffmann,\ \BBA\ Dimopoulos}{Koehler
  et~al.}{1997}]{adlplangraph}
Koehler, J., Nebel, B., Hoffmann, J., \BBA\ Dimopoulos, Y. \BBOP1997\BBCP.
\newblock \BBOQ Extending planning graphs to an {ADL} sub-set\BBCQ\
\newblock In {\Bem Proceedings of the Fourth European Conference on Planning
  (ECP-97)}, \BPGS\ 275--287.

\bibitem[\protect\BCAY{Long\ \BBA\ Fox}{Long\ \BBA\ Fox}{2003}]{longfox2003}
Long, D.\BBACOMMA\  \BBA\ Fox, M. \BBOP2003\BBCP.
\newblock \BBOQ The 3rd {I}nternational {P}lanning {C}ompetition: {R}esults and
  {A}nalysis\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 20}, 1--59.

\bibitem[\protect\BCAY{Long\ \BBA\ Fox}{Long\ \BBA\
  Fox}{1999}]{long99efficient}
Long, D.\BBACOMMA\  \BBA\ Fox, M. \BBOP1999\BBCP.
\newblock \BBOQ Efficient implementation of the plan graph in {STAN}\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 10},
  87--115.

\bibitem[\protect\BCAY{Long\ \BBA\ Fox}{Long\ \BBA\ Fox}{2003}]{ipc3results}
Long, D.\BBACOMMA\  \BBA\ Fox, M. \BBOP2003\BBCP.
\newblock \BBOQ The third international planning competition: Results and
  analysis\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 20}, 1--59.

\bibitem[\protect\BCAY{McDermott}{McDermott}{1996}]{mcdermott}
McDermott, D. \BBOP1996\BBCP.
\newblock \BBOQ A heuristic estimator for means ends analysis in planning\BBCQ\
\newblock In Drabble, B.\BED, {\Bem Proceedings of the Third International
  Conference on Artificial Intelligence Planning Systems ({AIPS}-96)}, \BPGS\
  142--149. AAAI Press.

\bibitem[\protect\BCAY{McDermott}{McDermott}{2000}]{pddl1}
McDermott, D. \BBOP2000\BBCP.
\newblock \BBOQ The 1998 {AI} planning systems competition\BBCQ\
\newblock {\Bem {AI} Magazine}, {\Bem 21\/}(2), 35--55.

\bibitem[\protect\BCAY{Minton}{Minton}{1985}]{minton85}
Minton, S. \BBOP1985\BBCP.
\newblock \BBOQ Selectively generalizing plans for problem-solving\BBCQ\
\newblock In {\Bem Proceedings of the Ninth International Joint Conference on
  Artificial Intelligence ({IJCAI}-85)}.

\bibitem[\protect\BCAY{Nebel, Hoffmann,\ \BBA\ Thiebaux}{Nebel
  et~al.}{2003}]{indefenseofpddlaxioms}
Nebel, B., Hoffmann, J., \BBA\ Thiebaux, S. \BBOP2003\BBCP.
\newblock \BBOQ In defense of {PDDL} axioms\BBCQ\
\newblock In {\Bem Proceedings of the Eighteenth International Joint Conference
  on Artificial Intelligence ({IJCAI}-03)}, \BPGS\ 961--966.

\bibitem[\protect\BCAY{Newton, Levine,\ \BBA\ Fox}{Newton
  et~al.}{2005}]{newtonmacro}
Newton, M., Levine, J., \BBA\ Fox, M. \BBOP2005\BBCP.
\newblock \BBOQ Genetically evolved macro-actions in {A.I.} planning
  problems\BBCQ\
\newblock In Tuson, A.\BED, {\Bem Proceedings of the 24th UK Planning and
  Scheduling {SIG}}, \BPGS\ 163--172.

\bibitem[\protect\BCAY{Pednault}{Pednault}{1989}]{adl}
Pednault, E. \BBOP1989\BBCP.
\newblock \BBOQ {ADL}: Exploring the middle ground between {STRIPS} and the
  situation calculus\BBCQ\
\newblock In {\Bem Proceedings of the First International Conference on
  Principles of Knowledge Representation and Reasoning}, \BPGS\ 324--332.

\bibitem[\protect\BCAY{Vidal}{Vidal}{2004}]{yahsp}
Vidal, V. \BBOP2004\BBCP.
\newblock \BBOQ A lookahead strategy for heuristic search planning\BBCQ\
\newblock In {\Bem Proceedings of the Fourteenth International Conference on
  Automated Planning and Scheduling (ICAPS-04)}, \BPGS\ 150--160.

\end{thebibliography}
