1. Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1–2), 35–84 (2003)
2. Edelkamp, S., Kissmann, P.: Solving fully-observable non-deterministic planning problems via translation into a general game. In: Proc. 32nd German Annual Conference on Artificial Intelligence, KI 2009 (2009)
3. Bryce, D., Kambhampati, S., Smith, D.E.: Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research 26, 35–99 (2006)
4. Hoffmann, J., Brafman, R.I.: Contingent planning via heuristic forward search with implicit belief states. In: Proc. 15th International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 71–80 (2005)
5. Bercher, P., Mattmüller, R.: A planning graph heuristic for forward-chaining adversarial planning. In: Proc. 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 921–922 (2008)