481. Forestier J.-P. and Varaiya P. (1978) Multilayer control of large Markov chains. IEEE Transactions onAutomatic Control, 23(2), p. 298-304.

482. Forgy С (1981) OPS5 user's manual. Technical report CMU-CS-81-135, Computer ScienceDepartment, Carnegie-Mellon University, Pittsburgh.

483. Forgy С (1982) A fast algorithm for the many patterns/many objects match problem. ArtificialIntelligence, 19(1),p. 17-37.

484. Forsyth D. and Zisserman A. (1991) Reflections on shading. IEEE Transactions on Pattern Analysisand Machine Intelligence (PAMI), 13(1), p. 671-679.

485. Fortescue M. D. (1984) WestGreenlandic. Croom Helm, London.

486. Foster D. W. (1989) Elegy by W. W.: A Study in Attribution. Associated University Presses, Cranbury,New Jersey.

487. Fourier J. (1827) Analyse des travaux de I'Academie Royale des Sciences, pendant I'annee 1824; partiemathematique. Histoire de I'Academie Royale des Sciences de France, 7, xlvii—lv.

488. Fox D., Burgard W., Dellaert F., and Thrun S. (1999) Monte carlo localization: Efficient positionestimation for mobile robots. In Proceedings of the National Conference on Artificial Intelligence (AAAI), Orlando, FL. AAAI.

489. Fox M. S. (1990) Constraint-guided scheduling: A short history of research at CMU. Computers inIndustry, 14(1-3), p. 79-88.

490. Fox M. S., Allen В., and Strohm G. (1982) Job shop scheduling: An investigation in constraint-directed reasoning. In Proceedings of the National Conference on Artificial Intelligence (AAAI-82), p. 155—158, Pittsburgh, Pennsylvania. Morgan Kaufmann.

491. Fox M. S. and Long D. (1998) The automatic inference of state invariants in TIM. Journal of ArtificialIntelligence Research, 9, p. 367-421.

492. Frakes W. and Baeza-Yates R. (Eds.) (1992) Information Retrieval: Data Structures and Algorithms.Prentice-Hall, Upper Saddle River, New Jersey.

493. Francis S. and Kucera H. (1967) Computing Analysis of Present-day American English. BrownUniversity Press, Providence, Rhode Island.

494. Franco J. and Paull M. (1983) Probabilistic analysis of the Davis Putnam procedure for solving thesatisfiability problem. Discrete Applied Mathematics, 5, p. 77-87.

495. Frank R. H. and Cook P. J. (1996) The Winner-Take-All Society. Penguin, New York.

496. Frege G. (1879) Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens.Halle, Berlin. Английский перевод опубликован в [1532].

497. Freuder E. С. (1978) Synthesizing constraint expressions. Communications of the Association forComputing Machinery, 2/(11), p. 958-966.

498. Freuder E. C. (1982) A sufficient condition for backtrack-free search. Journal of the Association forComputing Machinery, 29(1), p. 24-32.

499. Freuder E. C. (1985) A sufficient condition for backtrack-bounded search. Journal of the Associationfor Computing Machinery, 32(4), p. 755—761.

500. Freuder E. C. and Mackworth A. K. (Eds.) (1994) Constraint-based reasoning. MIT Press, Cambridge,Massachusetts.