\begin{thebibliography}{10}

\bibitem{graphviz:02}
{AT\&T Labs-Research}.
\newblock Graphviz.
\newblock Available from \url{http://www.research.att.com/sw/tools/graphviz/},
  2000.

\bibitem{bacchus:etal:96}
F.~Bacchus, C.~Boutilier, and A.~Grove.
\newblock Rewarding behaviors.
\newblock In {\em Proc. American National Conference on Artificial Intelligence
  (AAAI)}, pages 1160--1167, 1996.

\bibitem{bacchus:etal:97}
F.~Bacchus, C.~Boutilier, and A.~Grove.
\newblock Structured solution methods for non-{Markovian} decision processes.
\newblock In {\em Proc. American National Conference on Artificial Intelligence
  (AAAI)}, pages 112--117, 1997.

\bibitem{bacchus:kabanza:98}
F.~Bacchus and F.~Kabanza.
\newblock Planning for temporally extended goals.
\newblock {\em Annals of Mathematics and Artificial Intelligence}, 22:5--27,
  1998.

\bibitem{bacchus:kabanza:00}
F.~Bacchus and F.~Kabanza.
\newblock Using temporal logic to express search control knowledge for
  planning.
\newblock {\em Artificial Intelligence}, 116(1-2), 2000.

\bibitem{baier:etal:04}
C.~Baier, M.~{Gr\"o\ss er}, M.~Leucker, B.~Bollig, and F.~Ciesinski.
\newblock Controller synthesis for probabilistic systems (extended abstract).
\newblock In {\em Proc. IFIP International Conference on Theoretical Computer
  Science (IFIP TCS)}, 2004.

\bibitem{baral:zhao:04}
C.~Baral and J.~Zhao.
\newblock Goal specification in presence of nondeterministic actions.
\newblock In {\em Proc. European Conference on Artificial Intelligence (ECAI)},
  pages 273--277, 2004.

\bibitem{barto:etal:95}
A.G. Barto, S.L. Bardtke, and S.P. Singh.
\newblock Learning to act using real-time dynamic programming.
\newblock {\em Artificial Intelligence}, 72:81--138, 1995.

\bibitem{bonet:geffner:03}
B.~Bonet and H.~Geffner.
\newblock Labeled {RTDP}: Improving the convergence of real-time dynamic
  programming.
\newblock In {\em Proc. International Conference on Automated Planning and
  Scheduling (ICAPS)}, pages 12--21, 2003.

\bibitem{bonet:geffner:05}
B.~Bonet and H.~Geffner.
\newblock {mGPT}: A probabilistic planner based on heuristic search.
\newblock {\em Journal of Artificial Intelligence Research}, 24:933--944, 2005.

\bibitem{boutilier:etal:99}
C.~Boutilier, T.~Dean, and S.~Hanks.
\newblock Decision-theoretic planning: Structural assumptions and computational
  leverage.
\newblock In {\em Journal of Artificial Intelligence Research}, volume~11,
  pages 1--94, 1999.

\bibitem{boutilier:etal:00}
C.~Boutilier, R.~Dearden, and M.~Goldszmidt.
\newblock Stochastic dynamic programming with factored representations.
\newblock {\em Artificial Intelligence}, 121(1-2):49--107, 2000.

\bibitem{calvanese:etal:02}
D.~Calvanese, G.~{De Giacomo}, and M.~Vardi.
\newblock Reasoning about actions and planning in {LTL} action theories.
\newblock In {\em Proc. International Conference on the Principles of Knowledge
  Representation and Reasoning (KR)}, pages 493--602, 2002.

\bibitem{cesta:etal:03}
A.~Cesta, S.~Bahadori, Cortellessa G, G.~Grisetti, M.V. Giuliani, L.~Loochi,
  G.R. Leone, D.~Nardi, A.~Oddi, F.~Pecora, R.~Rasconi, A~Saggase, and
  M.~Scopelliti.
\newblock The {RoboCare} project. {Cognitive} systems for the care of the
  elderly.
\newblock In {\em Proc. International Conference on Aging, Disability and
  Independence (ICADI)}, 2003.

\bibitem{chomicki:95}
J.~Chomicki.
\newblock Efficient checking of temporal integrity constraints using bounded
  history encoding.
\newblock {\em ACM Transactions on Database Systems}, 20(2):149--186, 1995.

\bibitem{dallago:etal:02}
U.~{Dal Lago}, M.~Pistore, and P.~Traverso.
\newblock Planning with a language for extended goals.
\newblock In {\em Proc. American National Conference on Artificial Intelligence
  (AAAI)}, pages 447--454, 2002.

\bibitem{dean:etal:95}
T.~Dean, L.~Kaelbling, J.~Kirman, and A.~Nicholson.
\newblock Planning under time constraints in stochastic domains.
\newblock {\em Artificial Intelligence}, 76:35--74, 1995.

\bibitem{dean:kanazawa:89}
T.~Dean and K.~Kanazawa.
\newblock A model for reasoning about persistance and causation.
\newblock {\em Computational Intelligence}, 5:142--150, 1989.

\bibitem{drummond:89}
M.~Drummond.
\newblock Situated control rules.
\newblock In {\em Proc. International Conference on the Principles of Knowledge
  Representation and Reasoning (KR)}, pages 103--113, 1989.

\bibitem{emerson:90}
E.~A. Emerson.
\newblock Temporal and modal logic.
\newblock In {\em Handbook of Theoretical Computer Science}, volume~B, pages
  997--1072. Elsevier and MIT Press, 1990.

\bibitem{feng:hansen:02}
Z.~Feng and E.~Hansen.
\newblock Symbolic {LAO$^*$} search for factored {Markov} decision processes.
\newblock In {\em Proc. American National Conference on Artificial Intelligence
  (AAAI)}, pages 455--460, 2002.

\bibitem{feng:etal:03}
Z.~Feng, E.~Hansen, and S.~Zilberstein.
\newblock Symbolic generalization for on-line planning.
\newblock In {\em Proc. Conference on Uncertainty in Artificial Intelligence
  (UAI)}, pages 209--216, 2003.

\bibitem{fern:etal:04}
A.~Fern, S.~Yoon, and R.~Givan.
\newblock Learning domain-specific knowledge from random walks.
\newblock In {\em Proc. International Conference on Automated Planning and
  Scheduling (ICAPS)}, pages 191--198, 2004.

\bibitem{fourman:00}
M.~Fourman.
\newblock Propositional planning.
\newblock In {\em Proc. AIPS Workshop on Model-Theoretic Approaches to
  Planning}, pages 10--17, 2000.

\bibitem{gretton:etal:03}
C.~Gretton, D.~Price, and S.~Thi\'ebaux.
\newblock Implementation and comparison of solution methods for decision
  processes with non-{Markovian} rewards.
\newblock In {\em Proc. Conference on Uncertainty in Artificial Intelligence
  (UAI)}, pages 289--296, 2003.

\bibitem{gretton:etal:03:icaps}
C.~Gretton, D.~Price, and S.~Thi\'ebaux.
\newblock {NMRDPP:} a system for decision-theoretic planning with
  non-{Markovian} rewards.
\newblock In {\em Proc. ICAPS Workshop on Planning under Uncertainty and
  Incomplete Information}, pages 48--56, 2003.

\bibitem{haddawy:hanks:92}
P.~Haddawy and S.~Hanks.
\newblock Representations for decision-theoretic planning: Utility functions
  and deadline goals.
\newblock In {\em Proc. International Conference on the Principles of Knowledge
  Representation and Reasoning (KR)}, pages 71--82, 1992.

\bibitem{hansen:zilberstein:01}
E.~Hansen and S.~Zilberstein.
\newblock {LAO$^*$}: A heuristic search algorithm that finds solutions with
  loops.
\newblock {\em Artificial Intelligence}, 129:35--62, 2001.

\bibitem{hoey:etal:99}
J.~Hoey, R.~{St-Aubin}, A.~Hu, and C.~Boutilier.
\newblock {SPUDD:} stochastic planning using decision diagrams.
\newblock In {\em Proc. Conference on Uncertainty in Artificial Intelligence
  (UAI)}, pages 279--288, 1999.

\bibitem{hoffmann:02}
J.~Hoffmann.
\newblock Local search topology in planning benchmarks: A theoretical analysis.
\newblock In {\em Proc. International Conference on AI Planning and Scheduling
  (AIPS)}, pages 92--100, 2002.

\bibitem{hoffmann:nebel: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{howard:60}
R.A. Howard.
\newblock {\em Dynamic Programming and {Markov} Processes}.
\newblock MIT Press, Cambridge, MA, 1960.

\bibitem{kabanza:thiebaux:05}
F.~Kabanza and S.~Thi\'ebaux.
\newblock Search control in planning for temporally extended goals.
\newblock In {\em Proc. International Conference on Automated Planning and
  Scheduling (ICAPS)}, pages 130--139, 2005.

\bibitem{karabaev:skvortsova:05}
E.~Karabaev and O~Skvortsova.
\newblock A {H}euristic {S}earch {A}lgorithm for {S}olving {F}irst-{O}rder
  {MDP}s.
\newblock In {\em Proc. {C}onference on Uncertainty in Artificial Intelligence
  (UAI)}, pages 292--299, July 2005.

\bibitem{koehler:schuster:00}
J.~Koehler and K.~Schuster.
\newblock Elevator control as a planning problem.
\newblock In {\em Proc. International Conference on AI Planning and Scheduling
  (AIPS)}, pages 331--338, 2000.

\bibitem{korf:90}
R.~Korf.
\newblock Real-time heuristic search.
\newblock {\em Artificial Intelligence}, 42:189--211, 1990.

\bibitem{kushmerick:etal:95}
N.~Kushmerick, S.~Hanks, and D.~Weld.
\newblock An algorithm for probabilistic planning.
\newblock {\em Artificial Intelligence}, 76:239--286, 1995.

\bibitem{lichtenstein:etal:85}
O.~Lichtenstein, A.~Pnueli, and L.~Zuck.
\newblock The glory of the past.
\newblock In {\em Proc. Conference on Logics of Programs}, pages 196--218.
  LNCS, volume 193, 1985.

\bibitem{onder:etal:06}
N.~Onder, G.~C. Whelan, and L.~Li.
\newblock Engineering a conformant probabilistic planner.
\newblock {\em Journal of Artificial Intelligence Research}, 25:1--15, 2006.

\bibitem{pistore:traverso:01}
M.~Pistore and P.~Traverso.
\newblock Planning as model-checking for extended goals in non-deterministic
  domains.
\newblock In {\em Proc. International Joint Conference on Artificial
  Intelligence (IJCAI-01)}, pages 479--484, 2001.

\bibitem{slaney:05}
J.~Slaney.
\newblock Semi-positive {LTL} with an uninterpreted past operator.
\newblock {\em Logic Journal of the IGPL}, 13:211--229, 2005.

\bibitem{slaney:thiebaux:01}
J.~Slaney and S.~Thi\'ebaux.
\newblock Blocks world revisited.
\newblock {\em Artificial Intelligence}, 125:119--153, 2001.

\bibitem{somenzi:01}
F.~Somenzi.
\newblock {CUDD: CU Decision Diagram Package}.
\newblock Available from {ftp://vlsi.colorado.edu/pub/}, 2001.

\bibitem{teichteilkonigsbuch:fabiani:05}
F.~Teichteil-K{\"o}nigsbuch and P.~Fabiani.
\newblock Symbolic heuristic policy iteration algorithms for structured
  decision-theoretic exploration problems.
\newblock In {\em Proc. ICAPS workshop on Planning under Uncertainty for
  Autonomous Systems}, 2005.

\bibitem{thiebaux:etal:95}
S.~Thi\'{e}baux, J.~Hertzberg, W.~Shoaff, and M.~Schneider.
\newblock A stochastic model of actions and plans for anytime planning under
  uncertainty.
\newblock {\em International Journal of Intelligent Systems}, 10(2):155--183,
  1995.

\bibitem{thiebaux:etal:02}
S.~Thi\'ebaux, F.~Kabanza, and J.~Slaney.
\newblock Anytime state-based solution methods for decision processes with
  non-{Markovian} rewards.
\newblock In {\em Proc. Conference on Uncertainty in Artificial Intelligence
  (UAI)}, pages 501--510, 2002.

\bibitem{thiebaux:etal:02:mochart}
S.~Thi\'ebaux, F.~Kabanza, and J.~Slaney.
\newblock A model-checking approach to decision-theoretic planning with
  non-{Markovian} rewards.
\newblock In {\em Proc. ECAI Workshop on Model-Checking in Artificial
  Intelligence (MoChArt-02)}, pages 101--108, 2002.

\bibitem{vardi:03}
M.~Vardi.
\newblock Automated verification = graph, logic, and automata.
\newblock In {\em Proc. International Joint Conference on Artificial
  Intelligence (IJCAI)}, pages 603--606, 2003.
\newblock Invited paper.

\bibitem{wolper:87}
P.~Wolper.
\newblock On the relation of programs and computations to models of temporal
  logic.
\newblock In {\em Proc. Temporal Logic in Specification, LNCS 398}, pages
  75--123, 1987.

\bibitem{younes:littman:04}
H.~L.~S. Younes and M.~Littman.
\newblock {PPDDL1.0}: An extension to {PDDL} for expressing planning domains
  with probabilistic effects.
\newblock Technical Report CMU-CS-04-167, School of Computer Science, Carnegie
  Mellon University, Pittsburgh, Pennsylvania, 2004.

\bibitem{younes:etal:05}
H.~L.~S. Younes, M.~Littman, D.~Weissmann, and J.~Asmuth.
\newblock The first probabilistic track of the {International Planning
  Competition}.
\newblock In {\em Journal of Artificial Intelligence Research}, volume~24,
  pages 851--887, 2005.

\bibitem{younes:simmons:04}
H.L.S. Younes and R.~G. Simmons.
\newblock Policy generation for continuous-time stochastic domains with
  concurrency.
\newblock In {\em Proc. International Conference on Automated Planning and
  Scheduling (ICAPS)}, pages 325--333, 2004.

\end{thebibliography}
