Труды КНЦ вып.9 (ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ вып. 10/2018(9))

3. Pednault E. ADL: Exploring the middle ground between STRIPS and the situation calculus. Proc. 1st Int. Conf. on Principles o f Knowledge Representation and Reasoning, 1989. pp. 324-332. 4. Penberthy J. and Weld D. Temporal planning with continuous change. Proc. 12th National Conf. on AI, 1994. pp.1010-1015. 5. Peot M. and Smith D. Conditional nonlinear planning, Proc. 1st Int. Conf. on AI Planning Systems, 1992. pp. 189-197. 6. Williamson M and Hanks S. Optimal planning with a goal-directed utility model. Proc. 2nd Int. Conf. on AI Planning Systems, 1994. pp.176-180. 7. Blum A and Furst M. Fast planning through planning graph analysis. Proc. 14th Int. Joint Conf. on AI, 1995. pp. 1636-1642. 8. Anderson C, Smith D. and Weld D. Conditional effects in Graphplan. Proc. 4th Int. Conf. on AI Planning Systems. 1998. pp. 44-53. 9. Blum A and Langeford J. Probabilistic planning in the Graphplan framework. Proc. AIPS-98 Workshop on Planning as Combinatorial Search, 1998. pp. 8-12. 10.Smith D and Weld D. Conformant Graphplan. Proc. 15th National Conf. on AI, 1998. pp. 889-896. 11.Smith D and Weld D. Temporal planning with mutual exclusion reasoning. Proc. 16th Int. Joint Conf. On AI, 1999. pp. 326-333. 12.Koehler J. Planning under resource constraints. Proc. 13th European Conf. on AI. 1998. pp. 489-493. 13.Weld D. Recent advances in AI planning. AI Magazine. 1999, 20(2), pp. 93-123. 14.Rintanen J. Planning and SAT. In A. Biere, H. van Maaren, M. Heule and Toby Walsh, Eds., Handbook o f Satisfiability, IOS Press. 2009, pp. 483-504. 15.Wolfman S. and Weld D. Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review. 1999. 15(1). 16.Drabble B. and Tate A. The use o f optimistic and pessimistic resource profiles to inform search in an activity based planner. Proc. 2nd Int. Conf. on AI Planning Systems, 1994. pp. 243-248. 17.Allen J. and Koomen J. Planning using a temporal world model. Proc. 8th Int. Joint Conf. on AI, 1983. pp. 741-747. 18.Wilkins D. Can AI planners solve practical problems? / Computational Intelligence 6(4), 1990. 19.Erol K., Hendler J., and Nau D. Semantics for Hierarchical Task Network Planning. Technical report CSTR-3239, Dept. o f Computer Science, U. Maryland. 1994. 20.Dean T., Kaelbling L., Kirman J., and Nicholson A. Planning under time constraints in stochastic domains. AI, 1995. 76, pp. 35-74. 21.Drabble B. Excalibur: a program for planning and reasoning with processes. Artificial Intelligence 1993. 62, pp.1-40. 22.Kautz H and Walser J. State-space planning by integer optimization. The Knowledge Engineering Review. 1999. 15(1). 23.Muscettola N. HSTS: integrating planning and scheduling. Proc. 12th National Conf. on AI, 1994, pp. 169-212. 24.Ferguson G., Allen J. and Miller B. TRAINS-95: towards a mixed-initiative planning assistant. Proc. 3rd Int. Conf. on AI Planning Systems, 1996. pp. 70-77. 25.Dechter R., Meiri I. and Pearl J. Temporal constraint networks. Artificial Intelligence, 1991, 49, pp. 61-95. 34