41. Arora S. (1998) Polynomial time approximation schemes for Euclidean traveling salesman and othergeometric problems. Journal of the Association for Computing Machinery, 45(5), p. 753-782.

42. Ashby W. R. (1940) Adaptiveness and equilibrium. Journal of Mental Science, 86, p. 478-483.

43. Ashby W. R. (1948) Design for a brain. Electronic Engineering, December, p. 379-383.

44. AshbyW. R. (1952) Designfora Brain. Wiley, New York.

45. Asimov I. (1942) Runaround. Astounding Science Fiction, March.

46. Asimov I. (1950) /, Robot. Doubleday, Garden City, New York.

47. Astrom K. J. (1965) Optimal control of Markov decision processes with incomplete state estimation./. Math. Anal. Applic, 10, p. 174-205.

48. Audi R. (Ed.) (1999) The Cambridge Dictionary of Philosophy. Cambridge University Press, Cambridge, UK.

49. Austin J. L. (1962) How To Do Things with Words. Harvard University Press, Cambridge, Massachusetts.

50. Axelrod R. (1985) The Evolution of Cooperation. Basic Books, New York.

51. Bacchus F. (1990) Representing and Reasoning with Probabilistic Knowledge. MIT Press, Cambridge,Massachusetts.

52. Bacchus F. and Grove A. (1995) Graphical models for preference and utility. In Uncertainty in ArtificialIntelligence: Proceedings of the Eleventh Conference, p. 3-10, Montreal, Canada. Morgan Kaufmann.

53. Bacchus F. and Grove A. (1996) Utility independence in a qualitative decision theory. In Proceedings ofthe Fifth International Conference on the Principles of Knowledge Representation and Reasoning, p. 542-552, San Mateo, California. Morgan Kaufmann.

54. Bacchus F., Grove A., Halpern J. Y, and Koller D. (1992) From statistics to beliefs. In Proceedings of the TenthNational Conference on Artificial Intelligence (AAAI-92), p. 602-608, San Jose. AAAI Press.

55. Bacchus F. and van Beek P. (1998) On the conversion between non-binary and binary constraintsatisfaction problems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), p. 311-318, Madison, Wisconsin. AAAI Press.

56. Bacchus F. and van Run P. (1995) Dynamic variable ordering in CSPs. In Proceedings of the FirstInternational Conference on Principles and Practice of Constraint Programming, p. 258-275, Cassis, France. Springer-Verlag.

57. Bachmann P. G. H. (1894) Die analytische Zahlentheorie. B. G. Teubner, Leipzig.

58. Backus J. W. (1996) Transcript of question and answer session. In Wexelblat R. L. (Ed.), History ofProgramming Languages, p. 162. Academic Press, New York.

59. Baeza-Yates R. and Ribeiro-Neto B. (1999) Modern Information Retrieval. Addison Wesley Longman,Reading, Massachusetts.

60. Bajcsy R. and Lieberman L. (1976) Texture gradient as a depth cue. Computer Graphics and ImageProcessing, 5(1), p. 52-67.