761. Kager R. (1999) Optimality Theory. Cambridge University Press, Cambridge, UK.

762. Kahneman D., Slovic P., and Tversky A. (Eds.) (1982) Judgment under Uncertainty: Heuristics andBiases. Cambridge University Press, Cambridge, UK.

763. Kaindl H. and Khorsand A. (1994) Memory-bounded bidirectional search. In Proceedings of theTwelfth National Conference on Artificial Intelligence (AAAI-94), p. 1359-1364, Seattle. AAAI Press.

764. Kalman R. (1960) A new approach to linear filtering and prediction problems. Journal of BasicEngineering, 82, p. 35—46.

765. Kambhampati S. (1994) Exploiting causal structure to control retrieval and refitting during plan reuse.Computational Intelligence, 10, p. 213-244.

766. Kambhampati S., Mali A. D., and Srivastava B. (1998) Hybrid planning for partially hierarchicaldomains. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), p. 882-888, Madison, Wisconsin. AAAI Press.

767. Kanal L. N. and Kumar V. (1988) Search in Artificial Intelligence. Springer-Verlag, Berlin.

768. Kanal L. N. and Lemmer J. F. (Eds.) (1986) Uncertainty in Artificial Intelligence. Elsevier/North-Holland, Amsterdam, London, New York.

769. Kanazawa К., Roller D., and Russell S. J. (1995) Stochastic simulation algorithms for dynamicprobabilistic networks. In Uncertainty in Artificial Intelligence: Proceedings of the Eleventh Conference, p. 346-351, Montreal, Canada. Morgan Kaufmann.

770. Kaplan D. and Montague R. (1960) A paradox regained. Notre Dame Journal of Formal Logic, /(3),p. 79-90.

771. Karmarkar N. (1984) A new polynomial-time algorithm for linear programming. Combinatorica, 4,p. 373-395.

772. Karp R. M. (1972) Reducibility among combinatorial problems. In Miller R. E. and Thatcher J. W.(Eds.) Complexity of Computer Computations, p. 85—103. Plenum, New York.

773. Kasami T. (1965) An efficient recognition and syntax analysis algorithm for context-free languages.Tech. rep. AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Massachusetts.

774. Kasparov G. (1997) IBM owes me a rematch. Time, 149(21), p. 66, 67.

775. Kasper R. T. (1988) Systemic grammar and functional unification grammar. In Benson J. and GreavesW. (Eds.) Systemic Functional Approaches to Discourse. Ablex, Norwood, New Jersey.

776. Kaufmann M., Manolios P., and Moore J. S. (2000) Computer-Aided Reasoning: An Approach. Kluwer,Dordrecht, Netherlands.

777. Kautz H., McAllester D. A., and Selman B. (1996) Encoding plans in propositional logic. InProceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, p. 374—384, Cambridge, Massachusetts. Morgan Kaufmann.

778. Kautz H. and Selman B. (1992) Planning as satisfiability. In ECAI 92: 10th European Conference onArtificial Intelligence Proceedings, p. 359-363, Vienna. Wiley.

779. Kautz H. and Selman B. (1998) BLACKBOX: A new approach to the application of theorem provingto problem solving. Working Notes of the AIPS-98 Workshop on Planning as Combinatorial Search.

780. Kavraki L., Svestka P., Latombe J.-C, and Overmars M. (1996) Probabilistic roadmaps for pathplanning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, /2(4), p. 566-580.