The Swedish AI Society Workshop May 20-21; 2010; Uppsala University
 F. Bacchus and M. Ady. Precondition control. Available at http://www.cs.toronto. edu/fbacchus/Papers/BApre.pdf; 1999.
 F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence; 116(1-2):123‚Äď191; 2000.
 C. B¬®ackstr¬®om. Computational aspects of reordering plans. Journal of Artificial Intelligence Research; 9 (99):137; 1998.
 B. Bonet and H. Gener. HSP: Heuristic search planner. AI Magazine; 21(2); 2000.
 C. Boutilier and R. I. Brafman. Partial-order planning with concurrent interacting actions. Journal of Artificial Intelligence Research; 14:105‚Äď136; 2001.
 R. I. Brafman and C. Domshlak. From one to many: Planning for loosely coupled multi-agent systems. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS); pages 28‚Äď35; Sydney; Australia; 2008.
 M. Brenner. Multiagent planning with partially ordered temporal plans. In Proc. IJCAI; 2003.
 J. Homann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research; 14:253‚Äď302; 2001.
 J. Kvarnstr¬®om and P. Doherty. TALplanner: A temporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence; 30:119‚Äď169; June 2000.
 E. D. Sacerdoti. The nonlinear nature of plans. In Proceedings of the 4th International Joint Conference on Artificial Intelligence; pages 206‚Äď214. Morgan Kaufmann Publishers Inc.; 1975.
 M. Veloso and P. Stone. FLECS: Planning with a flexible commitment strategy. Journal of Artificial Intelligence Research; 3:25‚Äď52; 1995.
 D. S. Weld. An introduction to least commitment planning. AI magazine; 15(4):27; 1994.