801.Kirousis L. M. and Papadimitriou С. Н. (1988) The complexity of recognizing polyhedral scenes. Journal of Computer and System Sciences, 37(\), 14-38.

802. Kitano H., Asada M., Kuniyoshi Y., Noda I., and Osawa E. (1997) RoboCup: The robot world cupinitiative. In Johnson W. L. and Hayes-Roth B. (Eds.) Proceedings of the First International Conference on Autonomous Agents, p. 340—347, New York. ACM Press.

803. Kjaerulff U. (1992) A computational scheme for reasoning in dynamic probabilistic networks. InUncertainty in Artificial Intelligence: Proceedings of the Eighth Conference, p. 121—129, Stanford, California. Morgan Kaufmann.

804. Klein D. and Manning C. D. (2001) Parsing with treebank grammars: Empirical bounds, theoretical models,and the structure of the Perm treebank. In Proceedings of the 39th Annual Meeting of the ACL.

805. Kleinberg J. M. (1999) Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5),p. 604-632.

806. Knight K. (1999) A statistical mt tutorial workbook, prepared in connection with the Johns HopkinsUniversity summer workshop.

807. Knoblock С. А. (1990) Learning abstraction hierarchies for problem solving. In Proceedings of the EighthNational Conference on Artificial Intelligence (AAAI-90), Vol. 2, p. 923-928, Boston. MIT Press.

808. Knuth D. E. (1968) Semantics for context-free languages. Mathematical Systems Theory, 2(2), p. 127-145.

809. Knuth D. E. (1973) The Art of Computer Programming (second edition). Vol. 2: FundamentalAlgorithms. Addison-Wesley, Reading, Massachusetts1.

810. Knuth D. E. (1975) An analysis of alpha-beta pruning. Artificial Intelligence, 5(4), p. 293-326.

811. Knuth D. E. and Bendix P. B. (1970) Simple word problems in universal algebras. In Leech J. (Ed.),Computational Problems in Abstract Algebra, p. 263-267. Pergamon, Oxford, UK.

812. Koditschek D. (1987) Exact robot navigation by means of potential functions: some topologicalconsiderations. In Proceedings of the 1987 IEEE International Conference on Robotics and Automation, Vol. 1, p. 1-6, Raleigh, North Carolina. IEEE Computer Society Press.

813. Koehler J., Nebel В., Hoffman J., and Dimopoulos Y. (1997) Extending planning graphs to an ADLsubset. In Proceedings of the Fourth European Conference on Planning, p. 273-285, Toulouse, France. Springer-Verlag.

814. Koenderink J. J. (1990) Solid Shape. MIT Press, Cambridge, Massachusetts.

815. Koenderink J. J. and van Doom A. J. (1975) Invariant properties of the motion parallax field due tothe movement of rigid bodies relative to an observer. Optica Acta, 22(9), p. 773-791.

816. Koenderink J. J. and van Doom A. J. (1991) AfFine structure from motion. Journal of the OpticalSociety of America A, 8, p. 377—385.

817. Koenig S. (1991) Optimal probabilistic and decision-theoretic planning using Markovian decisiontheory. Master's report, Computer Science Division, University of California, Berkeley.

818. Koenig S. (2000) Exploring unknown environments with real-time search or reinforcement learning.In Solla S. A., Leen Т. К., and Muller K.-R. (Eds.), Advances in Neural Information Processing Systems 12. MIT Press, Cambridge, Massachusetts.

819. Koenig S. and Simmons R. (1998) Solving robot navigation problems with initial pose uncertaintyusing real-time heuristic search. In aips98. AAAI Press, Menlo Park, California.

820. Kohn W. (1991) Declarative control architecture. Communications of the Association for ComputingMachinery, 34$), p. 65-79.