1. Complexity and Approximation;Ausiello,1999
2. Complexity results for SAS+ planning;Bäckström;Computational Intelligence,1995
3. J. Benton, M. van den Briel, S. Kambhampati, A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems, in: Boddy et al. [4], pp. 34–41
4. Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007),2007
5. Planning as heuristic search;Bonet;Artificial Intelligence,2001