1021. McDermott D. (1978a) Planning and acting. Cognitive Science, 2(2), p. 71-109.

1022. McDermott D. (1978b) Tarskian semantics, or, no notation without denotation! Cognitive Science, 2(3).

1023. McDermott D. (1987) A critique of pure reason. Computational Intelligence, 3(3), p. 151-237.

1024. McDermott D. (1996) A heuristic estimator for means-ends analysis in planning. In Proceedings of the ThirdInternational Conference on AIPlanning Systems, p. 142—149, Edinburgh, Scotland. AAAI Press.

1025. McDermott D. and Doyle J. (1980) Non-monotonic logic: i. Artificial Intelligence, 13(1—2), p. 41-72.

1026. McDermott J. (1982) Rl: A rule-based configurer of computer systems. Artificial Intelligence, 19(\),p. 39-88.

1027. McEliece R. J., MacKay D. J. C, and Cheng J.-F. (1998) Turbo decoding as an instance of Pearl's "beliefpropagation" algorithm. IEEE Journal on Selected Areas in Communications, 16(2), p. 140—152.

1028.  McGregor J. J. (1979) Relational consistency algorithms and their application in finding subgraphand graph isomorphisms. Information Sciences, 19(3), p. 229-250.

1029. McKeown K. (1985) Text Generation: Using Discourse Strategies and Focus Constraints to GenerateNatural Language Text. Cambridge University Press, Cambridge, UK.

1030. McLachlan G. J. and Krishnan T. (1997) The EM Algorithm and Extensions. Wiley, New York.

1031. McMillan K. L. (1993) Symbolic Model Checking. Kluwer, Dordrecht, Netherlands.

1032. Meehl P. (1955) Clinical vs. Statistical Prediction. University of Minnesota Press, Minneapolis.

1033. Melcuk I. A. and Polguere A. (1988) A formal lexicon in the meaning-text theory (or how to dolexica with words) Computational Linguistics, 13(3—A), p. 261-275.

1034. Mendel G. (1866) Versuche uber pflanzen-hybriden. Verhandlungen des Naturforschenden Vereins,Abhandlungen, Brunn, 4, p. 3-47. Translated into English by С. Т. Druery, published by Bateson (1902).

1035. Mercer J. (1909) Functions of positive and negative type and their connection with the theory ofintegral equations. Philos. Trans. Roy. Soc. London, A, 209, p. 415-446.

1036. Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., and Teller E. (1953) Equations of statecalculations by fast computing machines. Journal of Chemical Physics, 21, p. 1087—1091.

1037. Mezard M. and Nadal J.-P. (1989) Learning in feedforward layered networks: The tiling algorithm.Journal of Physics, 22, p. 2191-2204.

1038. Michalski R. S. (1969) On the quasi-minimal solution of the general covering problem. InProceedings of the First International Symposium on Information Processing, p. 125—128.

1039.  Michalski R. S., Carbonell J. G., and Mitchell Т. М. (Eds.) (1983) Machine Learning: An ArtificialIntelligence Approach, Vol. 1. Morgan Kaufmann, San Mateo, California.

1040.  Michalski R. S., Carbonell J. G., and Mitchell Т. М. (Eds.) (1986a) Machine Learning: An ArtificialIntelligence Approach, Vol. 2. Morgan Kaufmann, San Mateo, California.