1. A linear algorithm to solve fixed-point equations on transition systems;Arnold;Information Processing Letters,1988
2. Using sat and logic programming to design polynomial-time algorithms for planning in non-deterministic domains;Baral,2005
3. C. Baral, J. Zhao, Goal specification in presence of non-deterministic action, in: R.L. Mántaras, L. Saitta (Eds.), 16th European Conference on Artificial Intelligence, 2004, pp. 273–277.
4. Goal specification, non-determinism and quantifying over policies;Baral,2006
5. The computational complexity of propositional STRIPS planning;Bylander;Journal of Artificial Intelligence,1994