821. Koller D., Meggido N., and von Stengel B. (1996) Efficient computation of equilibria for extensivetwo-person games. Games and Economic Behaviour, 14(2), p. 247—259.

822. Koller D. and Pfeffer A. (1997) Representations and solutions for game-theoretic problems. ArtificialIntelligence, 94(1-2), p. 167-215.

823. Koller D. and Pfeffer A. (1998) Probabilistic frame-based systems. In Proceedings of the Fifteenth NationalConference on Artificial Intelligence (AAAI-98), p. 580-587, Madison, Wisconsin. AAAI Press.

824. Koller D. and Sahami M. (1997) Hierarchically classifying documents using very few words. InProceedings of the Fourteenth International Conference on Machine Learning, p. 170-178. Morgan Kaufmann.

825. Kolmogorov A. N. (1941) Interpolation und extrapolation von stationaren zufalligen folgen. Bulletin ofthe Academy of Sciences of the USSR, Ser. Math. 5, p. 3-14.

826. Kolmogorov A. N. (1950) Foundations of the Theory of Probability. Chelsea, New York.

827. Kolmogorov A. N. (1963) On tables of random numbers. Sankhya, the Indian Journal of Statistics,Series A 25.

828. Kolmogorov A. N. (1965) Three approaches to the quantitative definition of information. Problems inInformation Transmission, 7(1), p. 1-7.

829. Kolodner J. (1983) Reconstructive memory: A computer model. Cognitive Science, 7, p. 281-328.

830. Kolodner J. (1993) Case-Based Reasoning. Morgan Kaufmann, San Mateo, California.

831. Kondrak G. and van Beek P. (1997) A theoretical evaluation of selected backtracking algorithms.Artificial Intelligence, 89, p. 365-387.

832. Konolige K. (1997) COLBERT: A language for reactive control in Saphira. In KI-97: Advances inArtificial Intelligence, LNAI, p. 31-52. Springer Verlag.

833. Konolige K. (1982) A first order formalization of knowledge and action for a multi-agent planningsystem. In Hayes J. E., Michie D., and Pao Y.-H. (Eds.) Machine Intelligence 10. Ellis Horwood, Chichester, England.

834. Koopmans Т. С (1972) Representation of preference orderings over time. In McGuire С. В. and Radner R.(Eds.) Decision and Organization. Elsevier/North-Holland, Amsterdam, London, New York.

835. Korf R. E. (1985a) Depth-first iterative-deepening: an optimal admissible tree search. ArtificialIntelligence, 27(1), p. 97-109.

836. Korf R. E. (1985b) Iterative-deepening A*: An optimal admissible tree search. In Proceedings of theNinth International Joint Conference on Artificial Intelligence (IJCAI-85), p. 1034—1036, Los Angeles. Morgan Kaufmann.

837. Korf R. E. (1987) Planning as search: A quantitative approach. Artificial Intelligence, 33(1), p. 65-88.

838. Korf R. E. (1988) Optimal path finding algorithms. In Kanal L. N. and Kumar V. (Eds.) Search inArtificial Intelligence, chap. 7, p. 223—267. Springer-Verlag, Berlin.

839. Korf R. E. (1990) Real-time heuristic search. Artificial Intelligence, 42(3), p. 189-212.

840. Korf R. E. (1991) Best-first search with limited memory. UCLA Computer Science Annual.