881. Laird J. E., Rosenbloom P. S., and Newell A. (1986) Chunking in Soar: The anatomy of a generallearning mechanism. Machine Learning, 1, p. 11—46.

882. Lakoff G. (1987) Women, Fire, and Dangerous Things: What Categories Reveal about the Mind.University of Chicago Press, Chicago.

883. Lakoff G. and Johnson M. (1980) Metaphors We Live By. University of Chicago Press, Chicago.

884. Lamarck J. B. (1809) Philosophie zoologique. Chez Dentu et L'Auteur, Paris.

885. Langley P., Simon H. A., Bradshaw G. L., and Zytkow J. M. (1987) Scientific Discovery:Computational Explorations of the Creative Processes. MIT Press, Cambridge, Massachusetts.

886. Langton С (Ed.) (1995) Artificial life. MIT Press, Cambridge, Massachusetts.

887. Laplace P. (1816) Essaiphilosophique sur lesprobabilites (3rd edition). Courcier Imprimeur, Paris.

888. Lappin S. and Leass H. J. (1994) An algorithm for pronominal anaphora resolution. ComputationalLinguistics, 20(4), p. 535-561.

889. Lari K. and Young S. J. (1990) The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer, Speech and Language, 4, p. 35—56.

890. Larranaga P., Kuijpers C, Murga R., Inza I., and Dizdarevic S. (1999) Genetic algorithms for thetravelling salesman problem: A review of representations and operators. Artificial Intelligence Review, 13, p. 129-170.

891. Latombe J.-C. (1991) Robot Motion Planning. Kluwer, Dordrecht, Netherlands.

892. Lauritzen S. (1995) The EM algorithm for graphical association models with missing data.Computational Statistics and Data Analysis, 19, p. 191-201.

893. Lauritzen S. (1996) Graphical models. Oxford University Press, Oxford, UK.

894. Lauritzen S., Dawid A., Larsen В., and Leimer H. (1990) Independence properties of directed Markovfields. Networks, 20(5), p. 491-505.

895. Lauritzen S. and Spiegelhalter D. J. (1988) Local computations with probabilities on graphical structures andtheir application to expert systems. Journal of the Royal Statistical Society, В 50(2), p. 157—224.

896. Lauritzen S. and Wermuth N. (1989) Graphical models for associations between variables, some ofwhich are qualitative and some quantitative. Annals of Statistics, 17, p. 31—57.

897. Lavrac, N. and Dzeroski S. (1994) Inductive Logic Programming: Techniques and Applications. EllisHorwood, Chichester, England.

898. Lawler E. L. (1985) The traveling salesman problem: A guided tour of combinatorial optimization. Wiley,New York.

899. Lawler E. L., Lenstra J. K., Kan A., and Shmoys D. B. (1992) The Travelling Salesman Problem. WileyInterscience.

900. Lawler E. L., Lenstra J. K., Kan A., and Shmoys D. B. (1993) Sequencing and scheduling: algorithmsand complexity. In Graves S. C, Zipkin P. H., and Kan A. H. G. R. (Eds.) Logistics of Production and Inventory: Handbooks in Operations Research and Management Science, Volume 4, p. 445-522. North-Holland, Amsterdam.