\begin{thebibliography}{10}

\bibitem{bertoli02kacmbp}
P.~Bertoli and A.~Cimatti.
\newblock Improving heuristics for planning as search in belief space.
\newblock In {\em Proceedings of AIPS'02}, 2002.

\bibitem{cimatti01conformant}
P.~Bertoli, A.~Cimatti, and M.~Roveri.
\newblock Heuristic search + symbolic model checking = efficient conformant
  planning.
\newblock In {\em Proceedings of IJCAI'01}, 2001.

\bibitem{bertoli01planning}
P.~Bertoli, A.~Cimatti, M.~Roveri, and P.~Traverso.
\newblock Planning in nondeterministic domains under partial observability via
  symbolic model checking.
\newblock In {\em {Proceedings of IJCAI'01}}, 2001.

\bibitem{blum95fast}
A.~Blum and M.~Furst.
\newblock Fast planning through planning graph analysis.
\newblock In {\em Proceedings of {IJCAI}'95}, 1995.

\bibitem{bonet99planning}
B.~Bonet and H.~Geffner.
\newblock Planning as heuristic search: New results.
\newblock In {\em {Proceedings of ECP'99}}, 1999.

\bibitem{bonet00planning}
B.~Bonet and H.~Geffner.
\newblock Planning with incomplete information as heuristic search in belief
  space.
\newblock In {\em Proceedings of AIPS'00}, 2000.

\bibitem{CUDD}
K.~Brace, R.~Rudell, and R.~Bryant.
\newblock Efficient implementation of a bdd package.
\newblock In {\em Proceedings of the 27th ACM/IEEE design automation
  conference}, 1990.

\bibitem{bryant-ieeetc86}
R.~Bryant.
\newblock Graph-based algorithms for {B}oolean function manipulation.
\newblock {\em IEEE Transactions on Computers}, C-35(8):677--691, August 1986.

\bibitem{ICAPS04-BrKa}
D.~Bryce and S.~Kambhampati.
\newblock Heuristic guidance measures for conformant planning.
\newblock In {\em Proceedings of ICAPS'04}, 2004.

\bibitem{castellini01satconformant}
Claudio Castellini, Enrico Giunchiglia, and Armando Tacchella.
\newblock Improvements to sat-based conformant planning.
\newblock In {\em Proceedings of ECP'01}, 2001.

\bibitem{cimatti00conformant}
A.~Cimatti and M.~Roveri.
\newblock Conformant planning via symbolic model checking.
\newblock {\em Journal of Artificial Intelligence Research}, 13:305--338, 2000.

\bibitem{GSetCover}
T.~H. Cormen, C.~E. Leiserson, and R.~L. Rivest.
\newblock {\em Introduction to Algorithms}.
\newblock McGraw-Hill, 1990.

\bibitem{aaai05}
W.~Cushing and D.~Bryce.
\newblock State agnostic planning graphs.
\newblock In {\em Proceedings of AAAI'05}, 2005.

\bibitem{Kleer86}
J.~de~Kleer.
\newblock An {A}ssumption-{B}ased {TMS}.
\newblock {\em Artificial Intelligence}, 28(2):127--162, 1986.

\bibitem{aaai93*724}
Michael~R. Genesereth and Illah~R. Nourbakhsh.
\newblock Time-saving tips for problem solving with incomplete information.
\newblock In {\em Proceedings of AAAI'93}, 1993.

\bibitem{hansen-zilberstein:2001a}
E.A. Hansen and S.~Zilberstein.
\newblock {LAO}: {A} heuristic-search algorithm that finds solutions with
  loops.
\newblock {\em Artificial Intelligence}, 129(1--2):35--62, 2001.

\bibitem{cff}
J.~Hoffmann and R.~Brafman.
\newblock Conformant planning via heuristic forward search: A new approach.
\newblock In {\em Proceedings of ICAPS'04}, 2004.

\bibitem{hoffmann:nebel:jair-01}
J.~Hoffmann and B.~Nebel.
\newblock The {FF} planning system: Fast plan generation through heuristic
  search.
\newblock {\em Journal of Artificial Intelligence Research}, 14:253--302, 2001.

\bibitem{merging}
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 AIPS'96}, 1996.

\bibitem{ipp}
J.~Koehler, B.~Nebel, J.~Hoffmann, and Y.~Dimopoulos.
\newblock Extending planning graphs to an adl subset.
\newblock In {\em Proceedings of ECP'97}, 1997.

\bibitem{kurien02fragplan}
J.~Kurien, P.~Nayak, and D.E. Smith.
\newblock Fragment-based conformant planning.
\newblock In {\em Proceedings of AIPS'02}, 2002.

\bibitem{IPC}
Derek Long and Maria Fox.
\newblock The 3rd international planning competition: Results and analysis.
\newblock {\em Journal of Artificial Intelligence Research}, 20:1--59, 2003.

\bibitem{nguyen02planning}
X.~Nguyen, S.~Kambhampati, and R.S. Nigenda.
\newblock Planning graph as the basis for deriving heuristics for plan
  synthesis by state space and {CSP} search.
\newblock {\em Artificial Intelligence}, 135(1-2):73--123, 2002.

\bibitem{Nilson}
N.J. Nilsson.
\newblock {\em Principles of Artificial Intelligence}.
\newblock Morgan Kaufmann, 1980.

\bibitem{Pednault87Synthesizing}
Edwin P.~D. Pednault.
\newblock Synthesizing plans that contain actions with context-dependent
  effects.
\newblock {\em Computational Intelligence}, 4:356--372, 1988.

\bibitem{petrick02kbincomplete}
R.P.A. Petrick and F.~Bacchus.
\newblock A knowledge-based approach to planning with incomplete information
  and sensing.
\newblock In {\em Proceedings of AIPS'02}, 2002.

\bibitem{rintanen-act}
J.~Rintanen.
\newblock Expressive equivalence of formalisms for planning with sensing.
\newblock In {\em Proceedings of ICAPS'03}, 2003.

\bibitem{Rintanen03}
J.~Rintanen.
\newblock Product representation of belief spaces in planning under partial
  observability.
\newblock In {\em Proceedings of IJCAI'03}, 2003.

\bibitem{rintanen04}
J.~Rintanen.
\newblock Distance estimates for planning in the discrete belief space.
\newblock In {\em Proceedings of AAAI'04}, 2004.

\bibitem{AAAI98_IAAI98*889}
D.E. Smith and D.S. Weld.
\newblock Conformant graphplan.
\newblock In {\em Proceedings of AAAI'98}, 1998.

\bibitem{SGP}
D.S. Weld, C.~Anderson, and D.E. Smith.
\newblock Extending graphplan to handle uncertainty and sensing actions.
\newblock In {\em Proceedings of AAAI'98}, 1998.

\end{thebibliography}
