Литература

1. Aarup M., Arentoft M. M., Parrod Y., Stader J., and Stokes I. (1994) OPTIMUM-AIV: A knowledge-based planning and scheduling system for spacecraft AIV. In Fox M. and Zweben M. (Eds.) Knowledge Based Scheduling. Morgan Kaufmann, San Mateo, California.

2. Abramson B. and Yung M. (1989) Divide and conquer under global constraints: A solution to the N-queens problem. Journal of Parallel and Distributed Computing, (5(3), p. 649—662.

3. Ackley D. H. and Littman M. L. (1991) Interactions between learning and evolution. In Langton C,Taylor C, Farmer J. D., and Ramussen S. (Eds.) Artificial Life II, p. 487-509. Addison-Wesley, Redwood City, California.

4. Adelson-Velsky G. M., Arlazarov V. L., Bitman A. R., Zhivotovsky A. A., and Uskov A. V. (1970)Programming a computer to play chess. Russian Mathematical Surveys, 25, p. 221-262.

5. Adelson-Velsky G. M., Arlazarov V. L., and Donskoy M. V. (1975) Some methods of controlling the treesearch in chess programs. Artificial Intelligence, (5(4), p. 361-371.

6. Agmon S. (1954) The relaxation method for linear inequalities. Canadian J. Math., 5(3), p. 382—392.

7. Agre P. E. and Chapman D. (1987) Pengi: an implementation of a theory of activity. In Proceedings ofthe Tenth International Joint Conference on Artificial Intelligence (IJCAI-87), p. 268-272, Milan. Morgan Kaufmann.

8. Aho A. V., Hopcroft J., and Ullman J. D. (1974) The Design and Analysis of Computer Algorithms.Addison-Wesley, Reading, Massachusetts.

9. Aho A. V. and Ullman J. D. (1972) The Theory of Parsing, Translation and Compiling. Prentice-Hall,Upper Saddle River, New Jersey.

10. Ait-Kaci H. and Podelski A. (1993) Towards a meaning of LIFE. Journal of Logic Programming, 7(5(3-4), p. 195-234.

11. Aizerman M., Braverman E., and Rozonoer L. (1964) Theoretical foundations of the potential functionmethod in pattern recognition learning. Automation and Remote Control, 25, p. 821-837.

12. Albus J. S. (1975) A new approach to manipulator control: The cerebellar model articulation controller(CMAC). Journal of Dynamic Systems, Measurement, and Control, 97, p. 270-277.

13. Aldous D. and Vazirani U. (1994) "Go with the winners" algorithms. In Proceedings of the 35th AnnualSymposium on Foundations of Computer Science, p. 492—501, Santa Fe, New Mexico. IEEE Computer Society Press.

14. Allais M. (1953) Le comportment de l'homme rationnel devant la risque: critique des postulats etaxiomes de l'ecole Americaine. Econometrica, 21, p. 503—546.

15. Allen J. F. (1983) Maintaining knowledge about temporal intervals. Communications of the Associationfor Computing Machinery, 2(5(11), p. 832-843.

16. Allen J. F. (1984) Towards a general theory of action and time. Artificial Intelligence, 23, p. 123-154.

17. Allen J. F. (1991) Time and time again: The many ways to represent time. International Journal ofIntelligent Systems, 6, p. 341-355.

18. Allen J. F. (1995) Natural Language Understanding. Benjamin/Cummings, Redwood City; California.

19. Allen J. F., Hendler J., and Tate A. (Eds.) (1990) Readings in Planning. Morgan Kaufmann, San Mateo,California.

20. Almuallim H. and Dietterich T. (1991) Learning with many irrelevant features. In Proceedings of theNinth National Conference on Artificial Intelligence (AAAI-91), Vol. 2, p. 547-552, Anaheim, California. AAA! Press.