121. Bertsekas D. and Tsitsiklis J. N. (1996) Neuro-dynamic programming. Athena Scientific, Belmont,Massachusetts.

122. Bertsekas D. and Tsitsiklis J. N. (2002) Introduction to Probability. Athena Scientific, Belmont,Massachusetts.

123. Bibel W. (1981) On matrices with connections. Journal of the Association for Computing Machinery,28(4), p. 633-645.

124. Bibel W. (1993) Deduction: Automated Logic. Academic Press, London.

125. Biggs N. L., Lloyd E. K., and Wilson R. J. (1986) Graph Theory 1736-1936. Oxford University Press,Oxford, UK.

126. Binder J., Koller D., Russell S. J., and Kanazawa K. (1997a) Adaptive probabilistic networks withhidden variables. Machine Learning, 29, p. 213-244.

127. Binder J., Murphy K., and Russell S. J. (1997b) Space-efficient inference in dynamic probabilisticnetworks. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), p. 1292-1296, Nagoya, Japan. Morgan Kaufmann.

128. Binford Т. О. (1971) Visual perception by computer. Invited paper presented at the IEEE SystemsScience and Cybernetics Conference, Miami.

129. Binmore K. (1982) Essays on Foundations of Game Theory. Pitman, London.

130. Birnbaum L. and Selfridge M. (1981) Conceptual analysis of natural language. In Schank R. andRiesbeck C. (Eds.), Inside Computer Understanding. Lawrence Erlbaum, Potomac, Maryland.

131. Biro J. I. and Shahan R. W. (Eds.) (1982) Mind, Brain and Function: Essays in the Philosophy of Mind.University of Oklahoma Press, Norman, Oklahoma.

132. Birtwistle G., Dahl O.-J., Myrhaug В., and Nygaard K. (1973) Simula Begin. Studentliteratur (Lund)and Auerbach, New York.

133. Bishop С. М. (1995) Neural Networks for Pattern Recognition. Oxford University Press, Oxford, UK.

134. Bistarelli S., Montanari U., and Rossi F. (1997) Semiring-based constraint satisfaction andoptimization. Journal ofthe Association for Computing Machinery, 44(2), p. 201-236.

135. Bitner J. R. and Reingold E. M. (1975) Backtrack programming techniques. Communications of theAssociation for Computing Machinery, /#(11), p. 651-656.

136. Blei D. M., Ng A. Y., and Jordan M. I. (2001) Latent Dirichlet Allocation. In Neural InformationProcessing Systems, Vol. 14, Cambridge, Massachusetts. MIT Press.

137. Blinder A. S. (1983) Issues in the coordination of monetary and fiscal policies. In Monetary PolicyIssues in the 1980s. Federal Reserve Bank, Kansas City, Missouri.

138. Block N. (Ed.) (1980) Readings in Philosophy of Psychology, Vol. 1. Harvard University Press,Cambridge, Massachusetts.

139. Blum A. L. and Furst M. (1995) Fast planning through planning graph analysis. In Proceedings of theFourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), p. 1636-1642, Montreal. Morgan Kaufmann.

140. Blum A. L. and Furst M. (1997) Fast planning through planning graph analysis. Artificial Intelligence,90(1-2), p. 281-300.