1261. Quirk R., Greenbaum S., Leech G., and Svartvik J. (1985) A Comprehensive Grammar of the EnglishLanguage. Longman, New York.

1262. Rabani Y., Rabinovich Y., and Sinclair A. (1998) A computational view of population genetics.Random Structures and Algorithms, /2(4), p. 313-334.

1263. Rabiner L. R. and Juang B.-H. (1993) Fundamentals of Speech Recognition. Prentice-Hall, UpperSaddle River, New Jersey.

1264.  Ramakrishnan R. and Ullman J. D. (1995) A survey of research in deductive database systems.Journal of Logic Programming, 23(2), p. 125—149.

1265. Ramsey F. P. (1931) Truth and probability. In Braithwaite R. B. (Ed.), The Foundations ofMathematics and Other Logical Essays. Harcourt Brace Jovanovich, New York.

1266. Raphson J. (1690) Analysis aequationum universalis. Apud Abelem Swalle, London.

1267. Rassenti S., Smith V., and Bulfin R. (1982) A combinatorial auction mechanism for airport time slotallocation. Bell Journal of Economics, 13, p. 402-417.

1268. Ratner D. and Warmuth M. (1986) Finding a shortest solution for the n x n extension of the 15-puzzle is intractable. In Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86), Vol. 1, p. 168-172, Philadelphia. Morgan Kaufmann.

1269. Rauch H. E., Tung F., and Striebel С. Т. (1965) Maximum likelihood estimates of linear dynamicsystems. AIAA Journal, 3(8), p. 1445-1450.

1270. Rechenberg I. (1965) Cybernetic solution path of an experimental problem. Library translation 1122,Royal Aircraft Establishment.

1271. Rechenberg I. (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien derbiologischen Evolution. Frommann-Holzboog, Stuttgart, Germany.

1272. Regin J. (1994) A filtering algorithm for constraints of difference in CSPs. In Proceedings of theTwelfth National Conference on Artificial Intelligence (AAAI-94), p. 362-367, Seattle. AAA! Press.

1273. Reichenbach H. (1949) The Theory of Probability: An Inquiry into the Logical and MathematicalFoundations of the Calculus of Probability (Second edition). University of California Press, Berkeley and Los Angeles.

1274. Reif J. (1979) Complexity of the mover's problem and generalizations. In Proceedings of the 20thIEEE Symposium on Foundations of Computer Science, p. 421-427, San Juan, Puerto Rico. IEEE, IEEE Computer Society Press.

1275. Reiter E. and Dale R. (2000) Building Natural Language Generation Systems. Studies in NaturalLanguage Processing. Cambridge University Press, Cambridge, UK.

1276. Reiter R. (1980) A logic for default reasoning. Artificial Intelligence, 13(\-2), p. 81-132.

1277. Reiter R. (1991) The frame problem in the situation calculus: A simple solution (sometimes) and acompleteness result for goal regression. In Lifschitz V. (Ed.) Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, p. 359—380. Academic Press, New York.

1278. Reiter R. (2001a) On knowledge-based programming with sensing in the situation calculus. ACMTransactions on Computational Logic, 2(4), p. 433—457.

1279. Reiter R. (2001b) Knowledge in Action: Logical Foundations for Specifying and Implementing DynamicalSystems. MIT Press, Cambridge, Massachusetts.

1280. Reitman W. and Wilcox B. (1979) The structure and performance of the INTERIM.