2 Go program.In Proceedings of the Sixth International Joint Conference on Artificial Intelligence (IJCAI-79), p. 711-719, Tokyo. IJCAII.

1281. Remus H. (1962) Simulation of a learning machine for playing Go. In Proceedings IFIP Congress,p. 428-432, Amsterdam, London, New York. Elsevier/North-Holland.

1282. Rfinyi A. (1970) Probability Theory. Elsevier/North-Holland, Amsterdam, London, New York.

1283. RescherN. and Urquhart A. (1971) Temporal Logic. Springer-Verlag, Berlin.

1284. Reynolds С W. (1987) Flocks, herds, and schools: A distributed behavioral model. ComputerGraphics, 21, p. 25-34. SIGGRAPH '87 Conference Proceedings.

1285. Rich E. and Knight K. (1991) Artificial Intelligence (second edition). McGraw-Hill, New York.

1286. Richardson M., Bilmes J., and Diorio C. (2000) Hidden-articulator Markov models: Performanceimprovements and robustness to noise. In ICASSP-2000: 2000 International Conference on Acoustics, Speech, and Signal Processing, Los Alamitos, CA. IEEE Computer Society Press.

1287. Rieger С (1976) An organization of knowledge for problem solving and language comprehension.Artificial Intelligence, 7, p. 89-127.

1288. Ringle M. (1979) Philosophical Perspectives in Artificial Intelligence. Humanities Press, AtlanticHighlands, New Jersey.

1289. Rintanen J. (1999) Improvements to the evaluation of quantified boolean formulae. In Proceedings ofthe Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), p. 1192-1197, Stockholm. Morgan Kaufmann.

1290. Ripley В. D. (1996) Pattern Recognition and Neural Networks. Cambridge University Press,Cambridge, UK.

1291. Rissanen J. (1984) Universal coding, information, prediction, and estimation. IEEE Transactions onInformation Theory, IT-30(4), p. 629-636.

1292. Ritchie G. D. and Hanna F. K. (1984) AM: A case study in AI methodology. Artificial Intelligence,230), P- 249-268.

1293. Rivest R. (1987) Learning decision lists. Machine Learning, 2(3), p. 229-246.

1294. Roberts L. G. (1963) Machine perception of three-dimensional solids. Technical report 315, MITLincoln Laboratory.

1295. Robertson N. and Seymour P. D. (1986) Graph minors, ii. Algorithmic aspects of tree-width. Journalof Algorithms, 7(3), p. 309-322.

1296. Robertson S. E. (1977) The probability ranking principle in ir. Journal of Documentation, 33, p. 294—304.

1297. Robertson S. E. and Sparck Jones K. (1976) Relevance weighting of search terms. Journal of theAmerican Society for Information Science, 27, p. 129—146.

1298. Robinson J. A. (1965) A machine-oriented logic based on the resolution principle. Journal of theAssociation for Computing Machinery, 12, p. 23—41.

1299. Roche E. and Schabes Y. (1997) Finite-State Language Processing (Language, Speech andCommunication). Bradford Books, Cambridge.

1300. Rock I. (1984) Perception. W. H. Freeman, New York.