1. The *-minimax search procedure for trees containing chance nodes;Ballard;Artificial Intelligence,1983
2. Boutilier, C., and Dearden, R. 1994. Using abstractions for decision-theoretic planning with time constraints. In Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle. (to appear).
3. Dean, T., Kaelbling, L. P., Kirman, J., and Nicholson, A. 1993a. Deliberation scheduling for time-critical decision making. In Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence, pages 309–316, Washington, D.C.
4. Dean, T., Kaelbling, L. P., Kirman, J., and Nicholson, A. 1993b. Planning with deadlines in stochastic domains. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 574–579, Washington, D.C.
5. Strips: A new approach to the application of theorem proving to problem solving;Fikes;Artificial Intelligence,1971