Главная arrow книги arrow Копия Литература arrow Литература
Литература

141.Blumer A., Ehrenfeucht A., Haussler D., and Warmuth M. (1989) Learnability and the Vapnik-Chervonenkis dimension. Journal ofthe Association forComputing Machinery, 36(A), p. 929-965.

142. Bobrow D. G. (1967) Natural language input for a computer problem solving system. In Minsky M. L.(Ed.), Semantic Information Processing, p. 133-215. MIT Press, Cambridge, Massachusetts.

143. Bobrow D. G., Kaplan R., Kay M., Norman D. A., Thompson H., and Winograd T. (1977) GUS, aframe driven dialog system. Artificial Intelligence, 8, p. 155-173.

144. Bobrow D. G. and Raphael B. (1974) New programming languages for artificial intelligence research.Computing Surveys, 5(3), p. 153-174.

145. Boden M. A. (1977) Artificial Intelligence and Natural Man. Basic Books, New York.

146. Boden M. A. (Ed.) (1990) The Philosophy of Artificial Intelligence. Oxford University Press, Oxford, UK.

147. Bonet B. and Geffner H. (1999) Planning as heuristic search: New results. In Proceedings of theEuropean Conference on Planning, p. 360—372, Durham, UK. Springer-Verlag.

148. Bonet B. and Geffner H. (2000) Planning with incomplete information as heuristic search in beliefspace. In Chien S., Kambhampati S., and Knoblock С A. (Eds.), International Conference on Artificial Intelligence Planning and Scheduling, p. 52-61, Menlo Park, California. AAAI Press.

149. Boole G. (1847) The Mathematical Analysis of Logic: Being an Essay towards a Calculus of DeductiveReasoning. Macmillan, Barclay, and Macmillan, Cambridge.

150. Boolos G. S. and Jeffrey R. С (1989) Computability and Logic (3rd edition). Cambridge UniversityPress, Cambridge, UK.

151. Booth T. L. (1969) Probabilistic representation of formal languages. In IEEE Conference Record of the1969 Tenth Annual Symposium on Switching and Automata Theory, p. 74—81, Waterloo, Ontario. IEEE.

152. Borel E. (1921) La theorie du jeu et les equations integrates a noyau symetrique. Comptes RendusHebdomadaires des Seances de VAcademie des Sciences, 173, p. 1304—1308.

153. Borenstein J., Everett В., and Feng L. (1996) Navigating Mobile Robots: Systems and Techniques. A. K.Peters, Ltd., Wellesley, MA.

154. Borenstein J. and Koren Y. (1991) The vector field histogram— fast obstacle avoidance for mobilerobots. IEEE Transactions on Robotics and Automation, 7(3), p. 278—288.

155. Borgida A., Brachman R. J., McGuinness D. L., and Alperin Resnick L. (1989) CLASSIC:A structural data model for objects. SIGMOD Record, 18(2), p. 58-67.

156. Boser B. E., Guyon I. M., and Vapnik V. N. (1992) A training algorithm for optimal margin classifiers.In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (COLT-92), Pittsburgh, Pennsylvania. ACM Press.

157. Boutilier С and Brafman R. I. (2001) Partial-order planning with concurrent interacting actions.Journal of Artificial Intelligence Research, 14, p. 105-136.

158. Boutilier C, Dearden R., and Goldszmidt M. (2000) Stochastic dynamic programming with factoredrepresentations. Artificial Intelligence, 121, p. 49-107.

159. Boutilier C, Reiter R., and Price B. (2001) Symbolic dynamic programming for first-order MDPs. InProceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), p. 467-472, Seattle. Morgan Kaufmann.

160. Boutilier C, Reiter R., Soutchanski M., and Thrun S. (2000) Decision-theoretic, high-level agentprogramming in the situation calculus. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), p. 355-362, Austin, Texas. AAAI Press.