1081. Moore R. С (1985) A formal theory of knowledge and action. In Hobbs J. R. and Moore R. С(Eds.), Formal Theories of the Commonsense World, p. 319—358. Ablex, Norwood, New Jersey.

1082. Moravec H. P. (1983) The Stanford cart and the emu rover. Proceedings of the IEEE, 71(7), p. 872-884.

1083. Moravec H. P. and Elfes A. (1985) High resolution maps from wide angle sonar. In 1985 IEEEInternational Conference on Robotics and Automation, p. 116—121, St. Louis, Missouri. IEEE Computer Society Press.

1084. Moravec H. P. (1988) Mind Children: The Future of Robot and Human Intelligence. HarvardUniversity Press, Cambridge, Massachusetts.

1085. Moravec H. P. (2000) Robot: Mere Machine to Transcendent Mind. Oxford University Press.

1086. Morgenstern L. (1987) Knowledge preconditions for actions and plans. In Proceedings of the TenthInternational Joint Conference on Artificial Intelligence (IJCAI-87), p. 867-874, Milan. Morgan Kaufmann.

1087. Morgenstern L. (1998) Inheritance comes of age: Applying nonmonotonic techniques to problems inindustry; Artificial Intelligence, 103, p. 237-271.

1088. Morjaria M. A, Rink F. J., Smith W. D., Юетрпег G., Burns C, and Stein J. (1995) Elicitation ofprobabilities for belief networks: Combining qualitative and quantitative information. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, p. 141—148. Morgan Kaufmann.

1089. Morrison P. and Morrison E. (Eds.) (1961) Charles Babbage and His Calculating Engines: SelectedWritings by Charles Babbage and Others. Dover, New York.

1090.  Moskewicz M. W., Madigan С F., Zhao Y., Zhang L., and Malik S. (2001) Chaff: Engineering anefficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001), p. 530-535. ACM Press.

1091. Mosteller F. and Wallace D. L. (1964) Inference and Disputed Authorship: The Federalist. Addison-Wesley.

1092. Mostow J. and Prieditis A. E. (1989) Discovering admissible heuristics by abstracting and optimizing:A transformational approach. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), Vol. 1, p. 701-707, Detroit. Morgan Kaufmann.

1093. Motzkin T. S. and Schoenberg I. J. (1954) The relaxation method for linear inequalities. CanadianJournal of Mathematics, 6(3), p. 393-404.

1094. Moussouris J., Holloway J., and Greenblatt R. D. (1979) CHEOPS: A chess-oriented processingsystem. In Hayes J. E., Michie D., and Mikulich L. I. (Eds.), Machine Intelligence 9, p. 351-360. Ellis Horwood, Chichester, England.

1095. Moutarlier P. and Chatila R. (1989) Stochastic multisensory data fusion for mobile robot locationand environment modeling. In 5th Int. Symposium on Robotics Research, Tokyo.

1096. Muggleton S. H. (1991) Inductive logic programming. New Generation Computing, 8, p. 295—318.

1097. Muggleton S. H. (1992) Inductive Logic Programming. Academic Press, New York.

1098. Muggleton S. H. (1995) Inverse entailment and Progol. New Generation Computing, Special issue onInductive Logic Programming, 7.

3(3-4), p. 245-286.

1099. Muggleton S. H. (2000) Learning stochastic logic programs. Proceedings of the AAAI 2000Workshop on Learning Statistical Models from Relational Data.

1100. Muggleton S. H. and Buntine W. (1988) Machine invention of first-order predicates by invertingresolution. In Proceeding? of the Fifth International Conference on Machine Learning, p. 339—352. Morgan Kaufmann.