Bibliography

1. Abramson B, Yung M. “Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem”. Journal of Parallel and Distributed Computing. 1989;6:649–662.

2. Agre P, Chapman D. “Pengi: An Implementation of a Theory of Activity,”. In: Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87). Menlo Park, CA: AAAI Press; 1987;268–272.

3. Agre P, Chapman D. “What Are Plans For?”. Robotics and Autonomous Systems. 1990;6:17–34 Also in [Maes 1990a].

4. Albus JS. “Outline for a Theory of Intelligence”. IEEE Systems, Man, and Cybernetics. May/June 1991;21(3):473–509.

5. Allen J. “Maintaining Knowledge about Temporal Intervals”. Communications of the ACM. 1983;26(11):832–843.

5. Reprinted in Weld D, de Kleer J, eds. Readings in Qualitative Reasoning about Physical Systems. San Francisco: Morgan Kaufmann; 1990.

6. Allen J. “Towards a General Theory of Action and Time”. Artificial Intelligence. 1984;23:123–154.

7. Allen J. “Time and Time Again: The Many Ways to Represent Time”. International Journal of Intelligent Systems. 1991;6:341–355.

8. Allen J. “Temporal Reasoning and Planning”. In: Allen J, Kautz H, Pelavin R, Tenenberg J, eds. Reasoning About Plans. San Francisco: Morgan Kaufmann; 1991; Ch. 1.

9. Allen J. Natural Language Understanding Menlo Park, CA: Benjamin/Cummings; 1995.

10. Allen J, Hendler J, Tate A, eds. Readings in Planning. San Francisco: Morgan Kaufmann; 1990.

11. Almeida LB. “A Learning Rule for Asynchronous Perceptrons with Feedback in a Combinatorial Environment”. In: Caudill M, Butler C, eds. New York: IEEE; 1987;609–618. IEEE First International Conference on Neural Networks. vol. II San Diego, 1987.

12. Aloimonos Y, ed. Active Perception. Hillsdale, NJ: Lawerence Erlbaum Associates; 1993.

13. Anderson T, Donath M. “Animal Behavior as a Paradigm for Developing Robot Autonomy”. Robotics and Autonomous Systems. 1990;6:145–168 Also in [Maes 1990a].

14. Andre, D., “The Automatic Programming of Agents That Learn Mental Models and Create Simple Plans of Action,” in Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 741–747, San Francisco: Morgan Kaufmann, 1995.

15. Appelt D. “Planning English Referring Expressions”. Artificial Intelligence. 1985;26(1):1–33.

15. Also in Grosz B, Jones K, Webber B, eds. Readings in Natural Language Processing. San Francisco: Morgan Kaufmann; 1986.

16. Bacchus F, Yang Q. “The Expected Value of Hierarchical Problem-Solving”. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Menlo Park, CA: AAAI Press; 1992;369–374.

17. Baker A. “Nonmonotonic Reasoning in the Framework of Situation Calculus”. Artificial Intelligence. 1991;49:5–23.

18. Ballard DH. “Animate Vision”. Artificial Intelligence. 1991;48(l):57–86.

19. Ballard DH, Brown CM. Computer Vision Englewood Cliffs, NJ: Prentice Hall; 1982.

20. The Handbook of Artificial Intelligence. Volume 1. Barr A, Feigenbaum E, eds. Reading, MA: Addison–Wesley; 1981; (See the following two entries and [Cohen & Feigenbaum 1982] for the other three volumes.).

21. The Handbook of Artificial Intelligence. Volume 2. Barr A, Feigenbaum E, eds. Reading, MA: Addison–Wesley; 1982.

22. The Handbook of Artificial Intelligence. Volume 4. Barr A, Cohen PR, Feigenbaum E, eds. Reading, MA: Addison–Wesley; 1989.

23. Barto A, Bradtke S, Singh S. “Learning to Act Using Real-Time Dynamic Programming”. Artificial Intelligence. January 1995;72(12):81–138.

24. Barwise, J., and Etchemendy, J., The Language of First-Order Logic: Including the Macintosh Program Tarski’s World 4.0, Center for the Study of Language and Information (CSLI), Stanford, California, third revised and expanded edition, 1993.

25. Bates J. “The Role of Emotion in Believable Agents”. Communications of the ACM. 1994;37(7):122–125.

26. Bates, J., Loyall, A. B., and Reilly, W. S., “Integrating Reactivity, Goals, and Emotion in a Broad Agent,” Technical Report CMU–CS–92–142, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 1992. (Also appeared in the Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, Bloomington, Indiana, July 1992.).

27. Bayes T. “An Essay Towards Solving a Problem in the Doctrine of Chances”. Phil Trans. 1763;3:370–418.

27. Reproduced in Deming W, ed. Two Papers by Bayes. New York: Hafner; 1963.

28. Beer R. “A Dynamical Systems Perspective on Agent-Environment Interaction”. Artificial Intelligence. 1995;72(1–2):173–215.

29. Beer R, Chiel H, Sterling L. “A Biological Perspective on Autonomous Agent Design”. Robotics and Autonomous Systems. 1990;6:169–186 Also in [Maes 1990a].

30. Benson, S., Learning Action Models for Reactive Autonomous Agents, Stanford University Computer Science Department Ph.D. dissertation, Report No. STAN–CS–TR–97–1589, Stanford, CA 94305, 1997.

31. Benson S, Nilsson N. “Reacting, Planning and Learning in an Autonomous Agent”. In: Furukawa K, Michie D, Muggleton S, eds. Machine Intelligence 14. Oxford: The Clarendon Press; 1995.

32. Berliner H. “The B* Tree-Search Algorithm: A Best-First Proof Procedure”. Artificial Intelligence. 1979;12(1):23–40.

33. Bhanu B, Lee S. Genetic Learning for Adaptive Image Segmentation Boston: Kluwer Academic Publishers; 1994.

34. Binford TO. “Survey of Model-Based Image Analysis Systems”. The International Journal of Robotics Research. 1982;1(1):18–64.

35. Binford TO. “Generalized Cylinder Representation”. In: Shapiro SC, ed. Encyclopedia of Artificial Intelligence. New York: John Wiley & Sons; 1987;321–323. (This article is based on an unpublished 1971 paper by Binford entitled “Visual Perception by Computer”).

36. Bledsoe W. “Non-Resolution Theorem Proving”. Artificial Intelligence. 1977;9(1):1–35.

37. Blum A, Fürst M. “Fast Planning through Planning Graph Analysis”. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). San Francisco: Morgan Kaufmann; 1995;1636–1642. .

38. Blumberg B. Old Tricks, New Dogs: Ethology and Interactive Creatures MIT Media Lab, Massachusetts Institute of Technology 1996; Ph.D. Dissertation.

39. Bobrow D. “Natural Language Input for a Computer Problem Solving System”. In: Minsky M, ed. Semantic Information Processing. Cambridge, MA: MIT Press; 1968;133–215.

40. Bobrow D, Mittal S, Stefik M. “Expert Systems: Perils and Promise”. Communications of the ACM. 1986;29(9):880–894.

41. Bond A, Gasser L, eds. Readings in Distributed Artificial Intelligence. San Francisco: Morgan Kaufmann; 1988.

42. Boole G. An Investigation of the Laws of Thought on Which Are Founded the Mathematical Theories of Logic and Probabilities New York: Dover Publications; 1854.

43. Börger E. Computability, Complexity Logic Amsterdam: North-Holland; 1989.

44. Borgida A, Brachman R, McGuinness D, Resnick A. “CLASSIC: A Structural Data Model for Objects”. SIGMOD Record. 1989;18(2):58–67.

45. Boyer R, Moore J. A Computational Logic New York: Academic Press; 1979.

46. Brachman R, Levesque H, eds. Readings in Knowledge Representation. San Francisco: Morgan Kaufmann; 1985.

47. Brachman R, Gilbert V, Levesque H. “An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of KRYPTON”. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85). San Francisco: Morgan Kaufmann; 1985;532–539.

48. Brain, A. E., et al., “Graphical Data Processing Research Study and Experimental Investigation,” Report No. 8 (pp. 9–13) and No. 9 (pp. 3–10), Contract DA 36–039 SC-78343, SRI International, Menlo Park, CA, June 1962 and September 1962.

49. Braitenberg V. Vehicles: Experiments in Synthetic Psychology Cambridge, MA: MIT Press; 1984.

50. Bratko I. PROLOG Programming for Artificial Intelligence second edition Reading, MA: Addison-Wesley; 1990.

51. Bratko I, Michie D. “An Advice Program for a Complex Chess Programming Task”. Computer Journal. 1980;23(4):353–359.

52. Brave S. “The Evolution of Memory and Mental Models Using Genetic Programming”. In: Koza J, ed. Genetic Programming 1996: Proceedings of the First Annual Conference. Cambridge, MA: MIT Press; 1996;261–266. Stanford University, July 28–31, 1996.

53. Breiman L, Friedman J, Olshen R, Stone C. Classification and Regression Trees Belmont, CA: Wadsworth; 1984;.

54. Brewka, G., Dix, J., and Konolige, K., Nonmonotonic Reasoning: An Overview, CSLI Lecture Notes, No. 73, Center for the Study of Language and Information, Stanford, CA: Stanford University, 1997.

55. Brooks R. “Symbolic Reasoning among 3-D Models and 2-D Images”. Artificial Intelligence. 1981;17:285–348.

56. Brooks RA. “A Robust Layered Control System for a Mobile Robot”. IEEE Journal of Robotics and Automation. March 1986;RA–2(1):14–23.

57. Brooks R. “Elephants Don’t Play Chess”. Robotics and Autonomous Systems. 1990;6:3–15 Also in [Maes 1990].

58. Brooks RA. “Intelligence without Representation”. Artificial Intelligence. January 1991;47(1/3):139–159.

59. Brooks RA. “Intelligence Without Reason”. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91). San Francisco: Morgan Kaufmann; 1991;569–595.

60. Brooks R, Mataric M. “Real Robots, Real Learning Problems”. In: Connell J, Mahadevan S, eds. Robot Learning. Boston: Kluwer Academic Publishers; 1993; Ch. 8.

61. Brownston L, Farrell R, Kant E, Martin N. Programming Expert Systems in OPS5 Reading, MA: Addison-Wesley; 1985.

62. Bryson A, Ho Y-C. Applied Optimal Control New York: Blaisdell; 1969.

63. Buchanan B, Shortliffe E, eds. Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project. Reading, MA: Addison–Wesley; 1984.

64. Bylander T. “An Average Case Analysis of Planning”. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Menlo Park, CA: AAAI Press; 1993;480–485.

65. Bylander T. “The Computational Complexity of Propositional STRIPS Planning”. Artificial Intelligence. 1994;69(1/2):165–204.

66. Campbell AN, Hollister V, Duda R, Hart P. “Recognition of a Hidden Mineral Deposit by an Artificial Intelligence Program”. Science. 1982;217(4563):927–929.

67. Canny J. “A Computational Approach to Edge Detection”. IEEE Trans, on Pattern Analysis and Machine Intelligence. November 1986;PAMI–8(6):679–698.

68. Carbonell, J., Blythe, J., Etzioni, O., Gil, Y., Kahn, D., Knoblock, C., Minton, S., Perez, A., Reilly, S., Veloso, M., and Wang, X., “PRODIGY 4.0: The Manual and Tutorial,” Carnegie-Mellon University Computer Science Tech. Report CMU-CS-92–1560, Pittsburg, PA, 1992.

69. Cassandra A, Kaelbling L, Littman M. “Acting Optimally in Partially Observable Stochastic Domains”. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94). Menlo Park, CA: AAAI Press; 1994;1023–1028. .

70. Chakrabarti P, Ghose S, DeSarkar S. “Heuristic Search through Islands”. Artificial Intelligence. 1986;29(3):339–347.

71. Chang C-L, Lee R. Symbolic Logic and Mechanical Theorem Proving Boston: Academic Press; 1973.

72. Chapman D. “Planning for Conjunctive Goals”. Artificial Intelligence. 1987;32(3):333–377.

73. Chapman D. “Penguins Can Make Cake”. AI Magazine. 1989;10(4):45–50.

74. Charniak E. Statistical Language Learning Cambridge, MA: MIT Press; 1993.

75. Chauvin Y, Rumelhart D. Backpropagation: Theory, Architectures, and Applications Hillsdale, NJ: Lawrence Erlbaum; 1995.

76. Chen S, ed. Advances in Spatial Reasoning. Norwood, NJ: Ablex Publishing; 1990.

77. Chomsky N. Aspects of the Theory of Syntax Cambridge, MA: MIT Press; 1965.

78. Christensen J. “A Hierarchical Planner That Generates Its Own Hierarchies”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;1004–1009.

79. Churchland PS, Ramachandran VS, Sejnowski TJ. “A Critique of Pure Vision”. In: Koch C, Davis J, eds. Large-Scale Neuronal Theories of the Brain. Cambridge, MA: MIT Press; 1994;23–60.

80. Clocksin W, Mellish C. Programming in PROLOG third edition New York: Springer-Verlag; 1987.

81. Clowes M. “On Seeing Things”. Artificial Intelligence. 1971;2:79–116.

82. The Handbook of Artificial Intelligence. Volume 3. Cohen PR, Feigenbaum E, eds. Reading, MA: Addison-Wesley; 1982.

83. Cohen P, Levesque H. “Intention Is Choice with Commitment”. Artificial Intelligence. 1990;42(2–3):213–361.

84. Cohen P, Perrault CR. “Elements of a Plan-Based Theory of Speech Acts”. Cognitive Science. 1979;3:177–212.

85. Colmerauer, A., et al., “Un Système de Communication Homme–Machine en Français,” Research Report, Université Aix–Marseille II, Groupe d’Intelligence Artificielle, France, 1973.

86. Colmerauer, A., “Metamorphosis Grammars” In Bolc, L. Natural Language Communication with Computers,“ Berlin: Springer–Verlag. (This article is an English translation of a 1975 technical report written in French.).

87. Connell JH. “A Colony Architecture Applied to Robot Navigation,”. Technical Report 1151 Cambridge, MA: MIT AI Lab, MIT; June 1990.

88. Connell, J. H., “SSS: A Hybrid Architecture Applied to Robot Navigation”. In Proc. 1992 IEEE International Conj. on Robotics and Automation, pp. 2719–2724, 1992.

89. Connell J, Mahadevan S. “Rapid Task Learning for Real Robots”. In: Connell J, Mahadevan S, eds. Robot Learning. Boston: Kluwer Academic Publishers; 1993; Ch. 5.

90. Connell J, Mahadevan S, eds. Robot Learning. Boston: Kluwer Academic Publishers; 1993.

91. Cook S. “The Complexity of Theorem-Proving Procedures”. In: Proc of the 3rd Annual ACM Symposium on Theory of Computing. New York: Association for Computing Machinery; 1971;151–158.

92. Cook S. “Short Propositional Formulas Represent Nondeterministic Computations”. Information Processing Letters. 1988;26(5):269–270.

93. Cooper G. “Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks (Research Note)”. Artificial Intelligence. 1990;42(2/3):393–405.

94. Cooper G, Herskovitz E. “A Bayesian Method for the Induction of Probabilistic Networks from Data”. Machine Learning. 1992;9:309–347.

95. Cormen T, Leiserson C, Rivest R. Introduction to Algorithms Cambridge, MA, and New York: MIT Press and McGraw-Hill; 1990.

96. Cover T, Thomas A. Elements of Information Theory New York: John Wiley & Sons; 1991.

97. Currie K, Tate A. “O-PLAN: The Open Planning Architecture”. Artificial Intelligence. 1991;52(l):49–86.

98. Davis E. Representations of Commonsense Knowledge San Francisco: Morgan Kaufmann; 1990.

99. Davis M, Putnam H. “A Computing Procedure for Quantification Theory”. Journ Assoc of Comp Mach. 1960;7(3):201–215.

100. Davis R. “Meta-Rules: Reasoning about Control”. Artificial Intelligence. 1980;15(3):179–222.

101. de Kleer J. “An Assumption-Based TMS”. Artificial Intelligence. 1986;28(2):127–162.

102. de Kleer J. “Extending the ATMS”. Artificial Intelligence. 1986;28(2):163–196.

103. de Kleer J. “Problem Solving with the ATMS”. Artificial Intelligence. 1986;28(2):197–224.

104. Dean T, Boddy M. “An Analysis of Time-Dependent Planning”. In: Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88). Menlo Park, CA: AAAI Press; 1988;49–54.

105. Dean T, Wellman M. Planning and Control San Francisco: Morgan Kaufmann; 1991.

106. Dean T, Basye K, Kaelbling L. “Uncertainty in Graph-Based Map Learning”. In: Connell J, Mahadevan S, eds. Robot Learning. Boston: Kluwer Academic Publishers; 1993; Ch. 7.

107. Dechter R. “Bucket Elimination: A Unifying Framework for Probabilistic Inference”. In: Proceedings of the Twelfth Conference on Uncertainty in AI. San Francisco: Morgan Kaufmann; 1996;211–219.

108. Dempster AP. “A Generalization of Bayesian Inference”. Journal of the Royal Statistical Society, Series B. 1968;30:205–247.

109. Dempster A, Laird N, Rubin D. “Maximum Likelihood from Incomplete Data via the EM Algorithm”. Journal of the Royal Statistical Society Series B. 1977;39:1–38.

110. Dennett D. “Intentional Systems”. The Journal of Philosophy. 1971;68(4):87–106.

111. Dennett D. Darwin’s Dangerous Idea New York: Simon & Schuster; 1995.

112. Deutsch JA. The Structural Basis of Behavior Chicago: The University of Chicago Press; 1960.

113. Dietterich T. “Machine Learning” In Traub J et al (ed). Annual Review of Computer Science. 1990;4:255–306.

114. Dietterich T, Bakiri G. “Error-Correcting Output Codes: A General Method for Improving Multiclass Inductive Learning Programs”. In: Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91). Menlo Park, CA: AAAI Press; 1991;572–577.

115. Dietterich T, Bakiri G. “Solving Multiclass Learning Problems via Error-Correcting Output Codes”. Journal of Artificial Intelligence Research. 1995;2:263–286.

116. Dijkstra E. “A Note on Two Problems in Connection with Graphs”. Numerische Mathematik 1959;(1):269–271.

117. Doran, J., and Michie, D., “Experiments with the Graph Traverser Program,” Proc. Royal Society of London, vol. 294 (series A), pp. 235–259, 1966.

118. Dowling W, Gallier J. “Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulas”. Journal of Logic Programming 1984;(3):267–284.

119. Doyle J. “A Truth Maintenance System”. Artificial Intelligence. 1979;12(3):231–272.

119. Reprinted in Webber B, Nilsson N, eds. Readings in Artificial Intelligence. San Francisco: Morgan Kaufmann; 1981.

120. Dreyfus H. What Computers Can’t Do: The Limits of Artificial Intelligence revised edition New York: Harper and Row; 1979.

121. Dreyfus H. What Computers Still Can’t Do: A Critique of Artificial Reason Cambridge, MA: MIT Press; 1992.

122. Dreyfus H, Dreyfus S. Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer Oxford: Blackwell; 1986; (with T. Athanasiou).

123. Duda RO, Hart PE, Nilsson N. “Subjective Bayesian Methods for Rule-Based Inference Systems”. Proc AFIPS Nat Computer Conference. 1976;47:1075–1082.

123. Reprinted in Webber B, Nilsson N, eds. Readings in Artificial Intelligence. San Francisco: Morgan Kaufmann; 1981.

124. Duda RO, Hart PE, Stork D. Pattern Classification second edition New York: John Wiley & Sons; 1998.

125. Duda R, Gaschnig J, Hart P. “Model Design in the PROSPECTOR Consultant System for Mineral Exploration”. In: Michie D, ed. Expert Systems in the Microelectronic Age. Edinburgh: Edinburgh University Press; 1979;153–167.

125. Reprinted in Webber B, Nilsson N, eds. Readings in Artificial Intelligence. San Francisco: Morgan Kaufmann; 1979.

126. Dym C, Levitt R. Knowledge-Based Systems in Engineering New York: McGraw-Hill; 1991.

127. Elkan C. “Reasoning about Action in First-Order Logic”. In: Proc of the Ninth Biennial Conf of the Canadian Society for Computational Studies of Intelligence. San Francisco: Morgan Kaufmann; 1992;221–227.

128. Elkan C. “The Paradoxical Success of Fuzzy Logic”. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Menlo Park, CA: AAAI Press; 1993;698–703.

129. Elman J. “Finding Structure in Time”. Cognitive Science. 1990;14:179–211.

130. Emerson E. “Temporal and Modal Logic”. In: van Leeuwen J, ed. Handbook of Theoretical Computer Science. Amsterdam: North-Holland; 1989;995–1072.

131. Enderton H. A Mathematical Introduction to Logic New York: Academic Press; 1972.

132. Ephrati E, Pollack M, Milshtein M. “A Cost-Directed Planner: Preliminary Report”. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96). Menlo Park, CA: AAAI Press; 1996;1194–1201. .

133. Erman L, Hayes-Roth F, Lesser V, Reddy R. “The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty”. Computing Surveys. 1980;12:215–255.

134. Ernst M, Millstein T, Weld D. “Automatic SAT-Compilation of Planning Problems”. In: Proceedings of the Fifteenth International Conference on Artificial Intelligence (IJCAI-97). San Francisco: Morgan Kaufmann; 1997;1169–1176.

135. Erol K, Nau D, Subrahmanian V. “On the Complexity of Domain-Independent Planning”. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Menlo Park, CA: AAAI Press; 1992;381–386.

136. Erol K, Hendler J, Nau D. “HTN Planning: Complexity and Expressivity”. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94). Menlo Park, CA: AAAI Press; 1994;1123–1128.

137. Etzioni O. “Acquiring Search-Control Knowledge via Static Analysis”. Artificial Intelligence. 1993;62(2):255–301.

138. Etzioni O, Weld D. “A Softbot-Based Interface to the Internet”. Communications of the ACM. July 1994;37(7):72–76.

139. Evans TG. “A Program for the Solution of a Class of Geometric-Analogy Intelligence-Test Questions”. In: Minsky M, ed. Semantic Information Processing. Cambridge, MA: MIT Press; 1968;271–353.

140. Fagin R, Halpern J. “Belief, Awareness, and Limited Reasoning”. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85). San Francisco: Morgan Kaufmann; 1985;491–501.

141. Fagin R, Halpern J, Moses Y, Vardi M. Reasoning about Knowledge Cambridge, MA: MIT Press; 1995.

142. Faugeras O. Three-Dimensional Computer Vison: A Geometric Viewpoint Cambridge, MA: MIT Press; 1993.

143. Feigenbaum E, Feldman J, eds. Computers and Thought. New York: McGraw-Hill; 1963.

144. Feigenbaum E, Buchanan B, Lederberg J. “On Generality and Problem Solving: A Case Study Using the DENDRAL Program”. In: Meitzer B, Michie D, eds. Machine Intelligence 6. Edinburgh: Edinburgh University Press; 1971;165–190.

145. Feigenbaum E, McCorduck P, Nii HP. The Rise of the Expert Company: How Visionary Companies Are Using Artificial Intelligence to Achieve Higher Productivity and Profits New York: Times Books; 1988;.

146. Feller W. In: New York: John Wiley & Sons; 1968; An Introduction to Probability Theory and Applications. vol. 1.

147. Fikes R, Nilsson N. “STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving”. Artificial Intelligence. 1971;2(3/4):189–208.

148. Fikes R, Hart P, Nilsson N. “Learning and Executing Generalized Robot Plans”. Artificial Intelligence. 1972;3(4):251–288.

149. Finin T, Labrou Y, Mayfield J. “KQML as an Agent Communication Language”. In: Bradshaw J, ed. Software Agents. Cambridge, MA: MIT Press; 1997.

150. Firby RJ, Kahn R. “An Architecture for Vision and Action”. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). San Francisco: Morgan Kaufmann; 1995;72–79.

151. Fischler MA, Firschein O, eds. Readings in Computer Vision: Issues, Problems, Principles, and Paradigms. San Francisco: Morgan Kaufmann; 1987.

152. Fleischmann R, et al. “Whole-Genome Random Sequencing and Assembly of Haemophilus influenzae Rd“. Science. July 28, 1995;269:496–512.

153. Forbes J, Huang T, Kanazawa K, Russell S. “The BATmobile: Towards a Bayesian Automatic Taxi”. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). San Francisco: Morgan Kaufmann; 1995;1878–1885.

154. Forbus K, de Kleer J. Building Problem Solvers Cambridge, MA: MIT Press; 1993.

155. Forgy C. “RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem”. Artificial Intelligence. 1982;19(l):17–37.

156. Frege G. “Begriffsschrift, a Formula Language Modelled upon That of Arithmetic, for Pure Thought,” (1879). In: van Heijenoort J, ed. From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931. Cambridge, MA: Harvard University Press; 1967;1–82.

157. Friedman N. “Learning Belief Networks in the Presence of Missing Values and Hidden Variables,”. Proceedings of the Fourteenth International Conference on Machine Learning (ICML ‘97) San Francisco: Morgan Kaufmann; 1997.

158. Friedman N, Goldszmidt M. “Learning Bayesian Networks with Local Structure”. In: Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence. San Francisco: Morgan Kaufmann; 1996;252–262.

159. Friedman N, Goldszmidt M. “Building Classifiers Using Bayesian Networks,”. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96). Menlo Park, CA: AAAI Press; 1996;1277–1284. .

160. Fu LM. Neural Networks in Computer Intelligence New York: McGraw-Hill; 1994.

161. Galton A. Temporal Logics and Their Applications London: Academic Press; 1987.

162. Gardner M. Logic Machines and Diagrams second edition Chicago: The University of Chicago Press; 1982.

163. Garey M, Johnson D. Computers and Intractability New York: W. H. Freeman; 1979.

164. Gaschnig, J., “Performance Measurement and Analysis of Certain Search Algorithms,” Carnegie-Mellon University Computer Science Tech. Report CMU-CS-79–124, Pittsburg, PA, 1979.

165. Gaschnig J. “A Problem-Similarity Approach to Devising Heuristics: First Results”. In: Proceedings of the Sixth International Joint Conference on Artificial Intelligence (IJCAI-79). San Francisco: Morgan Kaufmann; 1979;301–307.

165. Reprinted in Webber B, Nilsson N, eds. Readings in Artificial Intelligence. San Francisco: Morgan Kaufmann; 1981.

166. Gat E. “Integrating Planning and Reacting in a Heterogeneous Asynchronous Architecture for Controlling Real–World Mobile Robots”. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Menlo Park, CA: AAAI Press; 1992;809–815.

167. Gelernter, H., “Realization of a Geometry Theorem-Proving Machine,” Proc. Intern. Conf. Inform Proc., UNESCO House, Paris, pp. 273–282, 1959. (Reprinted in Feigenbaum, E., Feldman, J. (eds). Computers and Thought, pp. 134–152, New York: McGraw-Hill, 1963.).

168. Genesereth M, Nilsson N. Logical Foundations of Artificial Intelligence San Francisco: Morgan Kaufmann; 1987.

169. Genesereth M., Fikes R. (eds)., Knowledge Interchange Format, Version 3.0 Reference Manual, Computer Science Department, Stanford University, Technical Report Logic-92–1, June 1992.

170. Gentner D. “Structure Mapping: A Theoretical Framework for Analogy”. Cognitive Science. 1983;7:155–170.

171. Gibson JJ. The Perception of the Visual World Boston: Houghton Mifflin; 1950.

172. Gibson JJ. The Ecological Approach to Visual Perception Boston: Houghton Mifflin; 1979.

173. Gil, Y., Acquiring Domain Knowledge for Planning by Experimentation, Ph.D. dissertation, School of Computer Science, Carnegie-Mellon University, 1992.

174. Ginsberg M, ed. Readings in Nonmonotonic Reasoning. San Francisco: Morgan Kaufmann; 1987;.

175. Ginsberg M. “Dynamic Backtracking”. Journal of Artificial Intelligence Research. 1993;1:25–46.

176. Ginsberg M. “Do Computers Need Commonsense?”. In: Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96). San Francisco: Morgan Kaufmann; 1996;620–626.

177. Ginsberg M, Frank M, Halpin M, Torrance M. “Search Lessons Learned from Crossword Puzzles”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;210–215.

178. Ginsberg ML, Harvey WD. “Iterative Broadening”. Artificial Intelligence. 1992;55(2/3):367–383.

179. Glesner S, Koller D. “Constructing Flexible Dynamic Belief Networks from First-Order Probabilistic Knowledge Bases,” Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU), Fribourg, Switzerland, July 1995. In: Froidevaux C, Kohlas J, eds. Lecture Notes in Artificial Intelligence. Berlin: Springer-Verlag; 1995;217–226.

180. Gogic G, Kautz H, Papadimitriou C, Selman B. “The Comparative Linguistics of Knowledge Representations”. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). San Francisco: Morgan Kaufmann; 1995;862–869.

181. Goldberg, A., “On the Complexity of the Satisfiability Problem,” Courant Computer Science Report No. 16, New York University, NY, 1979.

182. Goldberg D. Genetic Algorithms in Search, Optimization, and Machine Learning Reading, MA: Addison–Wesley; 1989.

183. Goldszmidt M, Morris P, Pearl J. “A Maximum Entropy Approach to Nonmonotonic Reasoning”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;646–652.

184. Green C. “Application of Theorem Proving to Problem Solving”. In: Proceedings of the First International Joint Conference on Artificial Intelligence (IJCAI-69). San Francisco: Morgan Kaufmann; 1969;741–747.

185. Green C. “Theorem-Proving by Resolution as a Basis for Question–Answering Systems”. In: Meitzer B, Michie D, eds. Machine Intelligence 4. Edinburgh: Edinburgh University Press; 1969;183–205.

186. Gregory R. Eye and Brain: The Psychology of Seeing New York: McGraw-Hill; 1966.

187. Grimson WEL. Object Recognition by Computer: The Role of Geometric Constraints Cambridge, MA: MIT Press; 1990.

188. Grosz B, Sparck Jones K, Webber B, eds. Readings in Natural Language Processing. San Francisco: Morgan Kaufmann; 1986;.

189. Grosz B, Appelt D, Martin P, Pereira F. “Team: An Experiment in the Design of Transportable Natural-Language Interfaces”. Artificial Intelligence. 1987;32(2):173–244.

190. Gruber T. “Toward Principles for the Design of Ontologies Used for Knowledge Sharing”. In: Guarino N, Poli R, eds. Formal Ontology in Conceptual Analysis and Knowledge Representation. Amsterdam: Kluwer Academic Publishers; 1997; (Original paper presented at the International Workshop on Formal Ontology, March 1993, Stanford Knowledge Systems Laboratory Report KSL-93–04.).

191. Gu J., Parallel Algorithms and Architectures for Very Fast AI Search, Ph.D. thesis, University of Utah, 1989.

192. Guha RV, Lenat D. “Cyc: A Midterm Report”. AI Magazine Fall 1990;33–59.

193. Gupta N, Nau D. “On the Complexity of Blocks-World Planning”. Artificial Intelligence. 1992;56(2/3):223–254.

194. Guzman A. “Decomposition of a Visual Scene into Three-Dimensional Bodies”. Proc Fall Joint Computer Conference. 1968;33:291–304.

195. Hanks S, McDermott D. “Default Reasoning, Nonmonotonic Logics, and the Frame Problem,”. In: Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86). Menlo Park, CA: AAAI Press; 1986;328–333.

195. Reprinted in Ginsberg M. In: Readings in Nonmonotonic Reasoning. San Francisco: Morgan Kaufmann; 1987;390–395.

196. Harnad S. “The Symbol Grounding Problem”. Physica D. 1990;42(1–3):335–346.

197. Hart P, Nilsson N, Raphael B. “A Formal Basis for the Heuristic Determination of Minimum Cost Paths”. IEEE Trans Syst Science and Cybernetics. 1968;SSC-4(2):100–107.

198. Hart P, Nilsson N, Raphael B. “Correction to ‘A Formal Basis for the Heuristic Determination of Minimum Cost Paths’”. SIGART Newsletter December 1972;(37):28–29.

199. Harvey, W. D., Nonsystematic Backtracking Search, Ph.D. dissertation, Department of Computer Science, Stanford University, December 1994.

200. Haussler D. “Quantifying Inductive Bias: AI Learning Algorithms and Valiant’s Learning Framework”. Artificial Intelligence. 1988;36:177–221.

200. Reprinted in Shavlik J, Dietterich T, eds. Readings in Machine Learning. San Francisco: Morgan Kaufmann; 1990.

201. Haussler D. “Probably Approximately Correct Learning,”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;1101–1108. .

202. Hayes PJ. “The Naive Physics Manifesto”. In: Michie D, ed. Expert Systems in the Microelectronic Age. Edinburgh: Edinburgh University Press; 1978.

203. Hayes PJ. “The Second Naive Physics Manifesto”. In: Hobbs J, Moore R, eds. Formal Theories of the Commonsense World. Norwood, NJ: Ablex; 1985;1–36. Ch. 1.

204. Hayes PJ. “Naive Physics I: Ontology for Liquids”. In: Hobbs J, Moore R, eds. Formal Theories of the Commonsense World. Norwood, NJ: Ablex; 1985;71–107. Ch. 3.

205. Hayes P, Ford K. “Turing Test Considered Harmful”. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). San Francisco: Morgan Kaufmann; 1995;972–977.

206. Hayes-Roth B. “A Blackboard Architecture for Control”. Artificial Intelligence. 1985;26(3):251–321.

207. Hayes-Roth B. “An Architecture for Adaptive Intelligent Systems”. Artificial Intelligence. 1995;72(1/2):329–365.

208. Hayes-Roth B, Washington R, Ash D, et al. “Guardian: An Intelligent Agent for ICU Monitoring”. J AI in Medicine. 1992;4:165–185.

209. Haykin S. Neural Networks: A Comprehensive Foundation New York: Macmillan College Publishing; 1994.

210. Hebert M, et al. “Mobility for Unmanned Ground Vehicles”. In: Firschein O, Strat T, eds. Reconnaissance, Surveillance, and Target Acquisition for the Unmanned Ground Vehicle: Providing the Surveillance “Eyes” for an Autonomous Vehicle. San Francisco: Morgan Kaufmann; 1997.

211. Heckerman D. Probabilistic Similarity Networks Cambridge, MA: MIT Press; 1991.

212. Heckerman, D., “A Tutorial on Learning with Bayesian Networks,” Microsoft Research Technical Report, MSR-TR-95–06, Redmond, WA, March 1995 (revised November 1996).

213. Heckerman D, Nathwani B. “An Evaluation of the Diagnostic Accuracy of Pathfinder”. SIAM Journal on Computing. 1992;25:56–74.

214. Heckerman D, Geiger D, Chickering D. “Learning Bayesian Networks: The Combination of Knowledge and Statistical Data”. Machine Learning. 1995;20(3):197–243.

215. Heinsohn J, Kudenko D, Nebel B, Profitlich H-J. “An Empirical Analysis of Terminological Representation Systems,”. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Menlo Park, CA: AAAI Press; 1992;767–773. .

216. Hendrix G. “Encoding Knowledge in Partitioned Networks”. In: Findler N, ed. Associative Networks. New York: Academic Press; 1979;51–92.

217. Henrion M. “Propagation of Uncertainty in Bayesian Networks by Probabilistic Logic Sampling”. In: Lemmer J, Kanal L, eds. New York: Elsevier/North-Holland; 1988;149–163. Uncertainty in Artificial Intelligence. 2.

218. Henrion M. “An Introduction to Algorithms for Inference in Belief Nets”. In: Henrion M, Shachter R, Kanal L, Lemmer J, eds. Amsterdam: North Holland; 1990; Uncertainty in Artificial Intelligence. 5.

219. Hertz J, Krogh A, Palmer R. Introduction to the Theory of Neural Computation Reading, MA: Addison–Wesley; 1991.

220. Hintikka J. Knowledge and Belief Ithaca, NY: Cornell University Press; 1962.

221. Hobbs J, Moore R, eds. Formal Theories of the Commonsense World. Norwood, NJ: Ablex; 1985.

222. Holland J. Adaptation in Natural and Artificial Systems Ann Arbor: The University of Michigan Press; 1975; (Second edition printed in 1992 by MIT Press, Cambridge, MA.).

223. Holland JH. “Escaping Brittleness: The Possibilities of General-Purpose Learning Algorithms Applied to Parallel Rule-Based Systems”. In: Michalski R, Carbonell J, Mitchell T, eds. San Francisco: Morgan Kaufmann; 1986; Machine Learning: An Artificial Intelligence Approach. Volume 2 Ch. 20.

224. Horn A. “On Sentences Which Are True of Direct Unions of Algebras”. Jour, of Symbolic Logic. 1951;16:14–21.

225. Horn BKP. Robot Vision Cambridge, MA: MIT Press; 1986.

226. Horowitz S, Pavlidis T. “Picture Segmentation by a Tree Traversal Algorithm”. Jour Assoc Comp Mach. April 1976;23(2):368–388.

227. Horswill I. “Polly: A Vision-Based Artificial Agent”. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Menlo Park, CA: AAAI Press; 1993;824–829.

228. Horvitz, E., “Reasoning about Beliefs and Actions under Computational Resource Constraints”. In Proc. of the 1987 Workshop on Uncertainty in Artificial Intelligence, pp. 429–444, 1987. (Also in Kanal, L., et al. (eds.), Uncertainty in Artificial Intelligence 3, pp. 301–324, New York: Elsevier, 1989.).

229. Horvitz E, Breese J, Henrion M. “Decision Theory in Expert Systems and Artificial Intelligence”. International Journal of Approximate Reasoning. 1988;2:247–302.

230. Hubel D. Eye, Brain, and Vision New York: W. H. Freeman; 1988.

231. Hubel D, Wiesel T. “Receptive Fields and Functional Architecture of Monkey Striate Cortex”. Journal of Physiology (London). March 1968;195(l):215–243.

232. Huberman, B. J., A Program to Play Chess End Games, Stanford University Computer Science Department Report CS 106, August 19, 1968.

233. Hueckel M. “A Local Visual Operator Which Recognizes Edges and Lines”. Journal of the Assoc for Comp Machinery. October 1973;20(4):634–647.

234. Huffman D. “Impossible Objects as Nonsense Sentences”. In: Meitzer B, Michie D, eds. Machine Intelligence 6. New York: American Elsevier; 1971;295–323.

235. Jain R, Kasturi R, Schunck B. Machine Vision New York: McGraw-Hill; 1995.

236. Jensen F. An Introduction to Bayesian Networks New York: Springer-Verlag; 1996.

237. Johnson-Laird P. The Computer and the Mind: An Introduction to Cognitive Science Cambridge, MA: Harvard University Press; 1988.

238. Jordan M, Rumelhart D. “Forward Models: Supervised Learning with a Distal Teacher”. Cognitive Science. 1992;16:307–354.

239. Juels A, Wattenberg M. “Stochastic Hillclimbing as a Baseline Method for the Evaluation of Genetic Algorithms”. In: Neural Information Processing Systems 8. Cambridge, MA: MIT Press; 1996.

240. Julesz B. Foundations of Cyclopean Perception Chicago: The University of Chicago Press; 1971.

241. Kaelbling L, Rosenschein S. “Action and Planning in Embedded Agents”. Robotics and Autonomous Systems. 1990;6:35–48 Also in [Maes 1990].

242. Kaelbling LP, Littman ML, Moore AW. “Reinforcement Learning: A Survey”. Journal of Artificial Intelligence Research. 1996;4:237–285.

243. Kanal L, Kumar V, eds. Search in Artificial Intelligence. Berlin: Springer-Verlag; 1988.

244. Karmarkar N. “A New Polynomial-Time Algorithm for Linear Programming”. Combinatorica. 1984;4(4):373–395.

245. Kartha GN. “Two Counterexamples Related to Baker’s Approach to the Frame Problem”. Artificial Intelligence. 1994;69(1–2):379–391.

246. Kautz, H., “Formalizing Spatial Concepts and Spatial Language” In Commonsense Summer: Final Report, Center for the Study of Language and Information (CSLI) Technical Report CSLI-85–35, Stanford University, Stanford, CA, 1985.

247. Kautz H. “A Formal Theory of Plan Recognition and Its Implementation”. In: Allen J, Kautz H, Pelavin R, Tenenberg J, eds. Reasoning About Plans. San Francisco: Morgan Kaufmann; 1991; Ch. 2.

248. Kautz H, Selman B. “Forming Concepts for Fast Inference”. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Menlo Park, CA: AAAI Press; 1992;787–793.

249. Kautz H, Selman B. “Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search”. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96). Menlo Park, CA: AAAI Press; 1996;1194–1201.

250. Kautz H, Kearns M, Selman B. “Reasoning with Characteristic Models,”. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Menlo Park, CA: AAAI Press; 1993;34–39.

251. Kautz H, McAllester D, Selman B. “Encoding Plans in Propositional Logic”. In: Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96). San Francisco: Morgan Kaufmann; 1996;374–384.

252. Kearns M, Vazirani U. An Introduction to Computational Learning Theory Cambridge, MA: MIT Press; 1994.

253. Khardon, R., and Roth, D., “Learning to Reason,” Journal of the ACM, to appear, 1998.

254. Kierulf A, Chen K, Nievergelt J. “Smart Game Board and Go Explorer: A Study in Software and Knowledge Engineering”. Comm of the ACM. 1990;33(2):152–167.

255. Kim J, Pearl J. “A Computational Model for Combined Causal and Diagnostic Reasoning in Inference Systems”. In: Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI-83). San Francisco: Morgan Kaufmann; 1983;190–193.

256. Kirkpatrick S, Gelatt C, Vecchi M. “Optimization by Simulated Annealing”. Science. 1983;220:671–680.

257. Kirsh D. “Today the Earwig, Tomorrow Man?”. Artificial Intelligence. 1991;47(1–3):161–184.

258. Knuth DE, Moore RW. “An Analysis of Alpha-Beta Pruning”. Artificial Intelligence. 1975;6(4):293–326.

259. Knoblock CA. “Learning Abstraction Hierarchies for Problem Solving”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;923–928. .

260. Koenderink J. “The Structure of Images”. Biological Cybernetics. 1984;50:363–370.

261. Kolodner J. Case-Based Reasoning San Francisco: Morgan Kaufmann; 1993.

262. Konolige K. “A First-Order Formalization of Knowledge and Action for a Multi-Agent Planning System”. In: Hayes J, Michie D, Pao Y, eds. Machine Intelligence 10. Chichester, England: Ellis Horwood, Ltd., 1982.

263. Konolige K. A Deduction Model of Belief London: Pitman; 1986.

264. Korf R. “Depth-First Iterative Deepening: An Optimal Admissible Tree Search Algorithm”. Artificial Intelligence. 1985;27:97–109.

265. Korf R. “Planning as Search: A Quantitative Approach”. Artificial Intelligence. 1987;33(l):65–88.

266. Korf R. “Real-Time Heuristic Search”. Artificial Intelligence. 1990;42.

267. Korf R. “Multi-Player Alpha-Beta Pruning”. Artificial Intelligence. 1991;48:99–111.

268. Korf R. “Search”. In: Shapiro S, ed. Encyclopedia of Artificial Intelligence, Second Edition. New York: John Wiley & Sons; 1992;1460–1467.

269. Korf R. “Linear-Space Best-First Search”. Artificial Intelligence. 1993;62:41–78.

270. Korf R. “Space-Efficient Search Algorithms”. ACM Computing Surveys. 1996;27(3):337–339.

271. Korf R. “Finding Optimal Solutions to Rubik’s Cube Using Pattern Databases”. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97). Menlo Park, CA: AAAI Press; 1997;700–705.

272. Korf R, Taylor L. “Finding Optimal Solutions to the Twenty-Four Puzzle”. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96). Menlo Park, CA: AAAI Press; 1996;1202–1207.

273. Kowalski R. “Predicate Logic as a Programming Language”. In: Proceedings of the IFIP-74 Congress. Amsterdam: Elsevier/North-Holland; 1974;569–574.

274. Kowalski R, Kim J-S. “A Metalogic Programming Approach to Multi-Agent Belief”. In: Lifschitz V, ed. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. Boston: Academic Press; 1991;231–246.

275. Koza J. Genetic Programming: On the Programming of Computers by Means of Natural Selection Cambridge, MA: MIT Press; 1992.

276. Koza J. Genetic Programming II: Automatic Discovery of Reusable Programs Cambridge, MA: MIT Press; 1994.

277. Koza J, Bennett III F, Andre D, Keane M. “Automated WYSIWYG Design of Both the Topology and Component Values of Analog Electrical Circuits Using Genetic Programming”. In: Koza John R, Goldberg David E, Fogel David B, Riolo Rick L, eds. Genetic Programming 1996: Proceedings of the First Annual Conference. Cambridge, MA: Stanford University, MIT Press; July 28–31, 1996;.

278. Kripke S. “Semantical Considerations on Modal Logic”. Acta Philosophica Fennica. 1963;16:83–94.

279. Kuipers B, Froom R, Lee W-Y, Pierce D. “The Semantic Hierarchy in Robot Learning”. In: Connell J, Mahadevan S, eds. Robot Learning. Boston: Kluwer Academic Publishers; 1993; Ch. 6.

280. Kuipers B, Byun Y-T. “A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representations”. Robotics and Autonomous Systems. 1991;8:47–63.

281. Kumar V, Kanal L. “The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch-and-Bound”. In: Kanal L, Kumar V, eds. Search in Artificial Intelligence. Berlin: Springer-Verlag; 1988;1–27. Ch. 1.

282. Kumar V. “Algorithms for Constraint-Satisfaction Problems: A Survey”. Artificial Intelligence Magazine. Spring 1992;13(1):32–44.

283. Laird J, Newell A, Rosenbloom P. “SOAR: An Architecture for General Intelligence”. Artificial Intelligence. 1987;33(1):1–64.

284. Laird J, Yager E, Hucka M, Tuck C. “Robo-Soar: An Integration of External Interaction, Planning, and Learning Using SOAR”. Robotics and Autonomous Systems. 1991;8:113–129.

285. Lakoff G. Women, Fire, and Dangerous Things: What Categories Reveal about the Mind Chicago: The University of Chicago Press; 1987.

286. Lakoff G, Johnson M. Metaphors We Live By Chicago: The University of Chicago Press; 1980.

287. Langley P. Elements of Machine Learning San Francisco: Morgan Kaufmann; 1996.

288. Latombe J-C. Robot Motion Planning Dordrecht: Kluwer Academic Publishers; 1991.

289. Lauritzen, S., “The EM Algorithm for Graphical Association Models with Missing Data,” Tech. Report TR-91–05, Dept. of Statistics, Aalborg University, Denmark, 1991.

290. Lauritzen S, Spiegelhalter D. “Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems”. Journal of the Royal Statistical Society. 1988;B50(2):157–224.

291. Lavrač N, Džeroski S. Inductive Logic Programming Chichester, England: Ellis Horwood; 1994;.

292. LeCun Y, Boser B, Denker J, et al. “Backpropagation Applied to Handwritten Zip Code Recognition”. Neural Computation. 1989;1.

293. Lee K-F, Mahajan S. “A Pattern Classification Approach to Evaluation Function Learning”. Artificial Intelligence. 1988;36(1):1–26.

294. Lenat D. “CYC: A Large-Scale Investment in Knowledge Infrastructure”. Comm ACM. November 1995;38(11):33–38.

295. Lenat D, Guha R. Building Large Knowledge Bases Reading, MA: Addison–Wesley; 1990.

296. Leonard-Barton D. “The Case for Integrative Innovation: An Expert System at Digital”. Sloan Management Review Fall 1987;7–19.

297. Letvinn J, Maturana H, McCulloch W, Pitts W. “What the Frog’s Eye Tells the Frog’s Brain”. Proc IRE. 1959;47:1940–1951.

298. Levesque H. “Foundations of a Functional Approach to Knowledge Representation”. Artificial Intelligence. 1984;23(2):155–212.

299. Levesque H. “A Logic of Implicit and Explicit Belief”. In: Proceedings of the Fourth National Conference on Artificial Intelligence (AAAI-84). Menlo Park, CA: AAAI Press; 1984;198–202.

300. Levesque H. “Making Believers Out of Computers”. Artificial Intelligence. 1986;30(1):81–108.

301. Levesque H, Brachman R. “Expressiveness and Tractability in Knowledge Representation and Reasoning”. Computational Intelligence. 1987;3(2):78–93.

302. Levesque H, Reiter R, Lesprance Y, Lin F, Scherl R. “GOLOG: A Logic Programming Language for Dynamic Domains,”. Journal of Logic Programming, Special Issue on Reasoning about Action and Change. 1997;31(1–3):59–83.

303. Lifschitz V. “On the Semantics of STRIPS”. In: Georgeff M, Lansky A, eds. Reasoning about Actions and Plans: Proceedings of the 1986 Workshop. San Francisco: Morgan Kaufmann; 1986;1–9. Timberline, Oregon.

303. Also in Allen J, Hendler J, Tate A, eds. Readings in Planning. San Francisco: Morgan Kaufmann; 1990.

304. Lindsay R, Buchanan B, Feigenbaum E, Lederberg J. Applications of Artificial Intelligence for Organic Chemistry: The DENDRAL Project New York: McGraw-Hill; 1980.

305. Lovejoy W. “A Survey of Algorithmic Methods for Partially Observed Markov Decision Processes”. Annals of Operations Research. 1991;28(1–4):47–66.

306. Loveland DW. Automated Theorem Proving: A Logical Basis New York: North-Holland; 1978.

307. Löwenheim L. “Über Möglichkeiten im Relativekalkül”. Mathematische Annalen. 1915;76:447–470.

307. English translation appears in van Heijenoort J, ed. From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931. Cambridge, MA: Harvard University Press; 1967.

308. Lowry M, McCartney R. Automating Software Design Cambridge, MA: MIT Press; 1991.

309. Lucas JR. “Minds, Machines, and Gödel”. Philosophy. 1961;36:112–127.

309. Also in Anderson AR, ed. Minds and Machines. Englewood Cliffs, NJ: Prentice Hall; 1964.

310. Luckham, D., “Refinement Theorems in Resolution Theory,” Proc. IRIA 1968 Symp. on Automatic Demonstration, Springer-Verlag Lecture Notes in Mathematics, No. 125, pp. 163–190, 1970.

311. Luckham DC, Nilsson N. “Extracting Information from Resolution Proof Trees”. Artificial Intelligence. 1971;2(1):27–54.

312. Maes P, ed. Designing Autonomous Agents: Theory and Practice from Biology to Engineering and Back. Cambridge, MA: MIT Press; 1990.

313. Maes P. “Guest Editorial”. Robotics and Autonomous Systems. 1990;6:1–2 Also in [Maes 1990a].

314. Magerman, D., Natural Language Parsing as Statistical Pattern Recognition, Ph.D. thesis, Department of Computer Science, Stanford University, 1993.

315. Mahadevan S. “Enhancing Transfer in Reinforcement Learning by Building Stochastic Models of Robot Actions”. In: Proceedings of the Ninth International Workshop on Machine Learning (ML92). San Francisco: Morgan Kaufmann; 1992;290–299.

316. Mahadevan S, Connell J. “Automatic Programming of Behavior-Based Robots Using Reinforcement Learning”. Artificial Intelligence. 1992;55(1–2):311–365.

317. Manna Z, Waldinger R. The Logical Basis for Computer Programming, Volume 1: Deductive Reasoning Reading, MA: Addison–Wesley; 1985.

318. Manna Z, Waldinger R. The Logical Basis for Computer Programming, Volume 2: Deductive Systems Reading, MA: Addison–Wesley; 1990.

319. Manna Z, Waldinger R. “Fundamentals of Deductive Program Synthesis,”. IEEE Transactions on Software Engineering. 1992;18(8):674–704.

320. Marr D. Vision: A Computational Investigation into the Human Representation and Processing of Visual Information New York: W. H. Freeman; 1982;.

321. Marr, D., and Hildreth, E., “Theory of Edge Detection,” Proc. Royal Soc. of London, Series B, Vol. 207, pp. 187–217, 1980.

322. Marr D, Poggio T. “A Computational Theory of Human Stereo Vision,”. Proceedings of the Royal Society London, B. 1979;204:301–328.

323. Martelli A, Montanari U. “Additive AND/OR Graphs”. In: Proceedings of the Third International Joint Conference on Artificial Intelligence (IJCAI-73). San Francisco: Morgan Kaufmann; 1973;1–11.

324. Masand, B., Linoff, G., and Waltz, D., “Classifying News Stories Using Memory Based Reasoning”. In Proceedings of ACM/SIGIR, pp. 59–65, 1992.

325. Mataric M. “A Distributed Model for Mobile Robot Environment Learning and Navigation,”. Technical Report No AIM-TR-1228 Cambridge, MA: MIT AI Lab, MIT; 1990.

326. Mataric M. “Designing and Understanding Adaptive Group Behavior”. Adaptive Behavior. 1996;4(1):51–80.

327. Mataric M. “Studying the Role of Embodiment in Cognition”. Cybernetics and Systems. 1997;28(6):457–470 (Special Issue on Epistemological Aspects of Embodied AI), July 1997.

328. Mauldin ML. “Chatterbots, Tinymuds, and the Turing Test: Entering the Loebner Prize Competition”. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94). Menlo Park, CA: AAAI Press; 1994;16–21.

329. McAdams H, Shapiro L. “Circuit Simulation of Genetic Networks”. Science. August 4, 1995;269:650–656.

330. McAllester D, Rosenblitt D. “Systematic Nonlinear Planning”. In: Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91). Menlo Park, CA: AAAI Press; 1991;634–639.

331. McCarthy J. “Programs with Common Sense”. In: London: Her Majesty’s Stationary Office; 1958;77–84. Mechanisation of Thought Processes, Proceedings of the Symposium of the National Physics Laboratory. Vol. I.

331. Also in Minsky M, ed. Semantic Information Processing. Cambridge, MA: MIT Press; 1968.

331. and Brachman R, Levesque H, eds. Readings in Knowledge Representation. San Francisco: Morgan Kaufmann; 1985.

332. McCarthy J. “Epistemological Problems in Artificial Intelligence”. In: Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI-77). San Francisco: Morgan Kaufmann; 1977;1038–1044.

333. McCarthy J. “Ascribing Mental Qualities to Machines”. In: Ringle M, ed. Philosophical Perspectives in Artificial Intelligence. Atlantic Highlands, NJ: Humanities Press; 1979;161–195. .

334. McCarthy J. “First-Order Theories of Individual Concepts and Propositions”. In: Hayes J, Michie D, Mikulich L, eds. Machine Intelligence 9. Chichester, England: Ellis Horwood, Ltd., 1979;129–147.

335. McCarthy J. “Circumscription: A Form of Non-monotonic Reasoning”. Artificial Intelligence. 1980;13(1–2):27–39.

336. McCarthy J. “Applications of Circumscription to Formalizing Commonsense Knowledge”. Artificial Intelligence. 1986;28(1):89–116.

337. McCarthy J. “AI as Sport,” (a Review of [Newborn 1996]). Science. June 6, 1997;276:1518–1519.

338. McCarthy J, Hayes P. “Some Philosophical Problems from the Standpoint of Artificial Intelligence”. In: Meitzer B, Michie D, eds. Machine Intelligence 4. Edinburgh: Edinburgh University Press; 1969.

339. McClelland J, Rumelhart D. “An Interactive Activation Model of Context Effects in Letter Perception, Part I: An Account of Basic Findings”. Psychological Renew. 1981;88:375–407.

340. McClelland J, Rumelhart D. “An Interactive Activation Model of Context Effects in Letter Perception, Part II: The Contextual Enhancement Effect and Some Tests and Extensions of the Model”. Psychological Renew. 1982;89:60–84.

341. McCorduck P. Machines Who Think San Francisco: W. H. Freeman; 1979.

342. McCulloch W, Pitts W. “A Logical Calculus of the Ideas Immanent in Nervous Activity”. Bulletin of Math Biophysics. 1943;5:115–133.

343. McCune W. “Automated Discovery of New Axiomatizations of the Left Group and Right Group Calculi”. Automated Reasoning. 1992;9(1):1–24.

344. McCune, W., OTTER 3.0 Reference Manual and Guide, Technical Report ANL-94/6, Argonne National Laboratory, Argonne, IL, 1994.

345. McDermott D. “A Critique of Pure Reason”. Computational Intelligence. 1987;3(3):151–237.

346. McDermott D, Doyle J. “Non-monotonic Logic I”. Artificial Intelligence. 1980;13(1–2):41–72.

347. McDermott J. “R1: A Rule-Based Configurer of Computer Systems”. Artificial Intelligence. 1982;19(1):39–88.

348. McDonald D, Bole L. Natural Language Generation Systems New York: Springer–Verlag; 1988.

349. McFarland D, ed. The Oxford Companion to Animal Behavior. Oxford: Oxford University Press; 1987;.

350. McFarland D, Bösser T. Intelligent Behavior in Animals and Robots Cambridge, MA: MIT Press; 1993.

351. McKeown K, Swartout W. “Language Generation and Explanation”. In: Palo Alto, CA: Annual Reviews; 1987; Annual Renew of Computer Science. vol. 2.

352. Mérõ L. “A Heuristic Search Algorithm with Modifiable Estimate”. Artificial Intelligence. 1984;23:13–27.

353. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs Berlin: Springer-Verlag; 1992.

354. Michalski, R., “On the Quasi-Minimal Solution of the General Covering Problem,” Proc. of the Fifth International Symposium on Information Processing (FCIP 69), Vol. A3, pp. 125–128, (Switching Circuits), Bled, Yugoslavia, 1969.

355. Michie D. “Game-Playing and Game-Learning Automata”. In: Fox L, ed. Advances in Programming and Non-numerical Computation. New York: Pergamon; 1966;183–200.

356. Miller R, Pople H, Myers J. “INTERNIST-1: An Experimental Computer-Based Diagnostic Consultant for General Internal Medicine”. New England Journal of Medicine. 1982;307:468–476.

357. Minker J. “Logic and Databases: Past, Present, and Future”. AI Magazine. Fall 1997;18(3):21–47.

358. Minnix, J., McVey, E., and Iñigo, R., “Multistage Self-Organizing Neural Network with Biologically Inspired Preprocessing Features for Rotation and Scale Invariant Pattern Recognition,” Proc. of the IEEE, pp. 1605–1610, 1991.

359. Minsky M. Computation: Finite and Infinite Machines Englewood Cliffs, NJ: Prentice Hall; 1967.

360. Minsky M. Society of Mind New York: Simon & Schuster; 1986.

361. Minton S. Learning Search Control Knowledge: An Explanation-Based Approach Boston: Kluwer Academic Publishers; 1988.

362. Minton S. “Quantitative Results Concerning the Utility of Explanation-Based Learning”. Artificial Intelligence. 1990;42(2–3):363–391.

363. Minton S, ed. Machine Learning Methods for Planning. San Francisco: Morgan Kaufmann; 1993.

364. Minton S, Carbonell J, Knoblock C, Kuokka D, Etzioni O, Gil Y. “Explanation-Based Learning: A Problem Solving Perspective”. Artificial Intelligence. 1989;40(1–3):63–118.

365. Minton S, Johnston M, Phillips A, Laird P. “Solving Large–Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;17–24. .

366. Minton S, Johnston M, Philips A, Laird P. “Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems”. Artificial Intelligence. 1992;58(1–3):161–205.

367. Minton S, Bresina J, Drummond M. “Total-Order and Partial-Order Planning: A Comparative Analysis”. Journal of Artificial Intelligence Research. 1994;2:227–262.

368. Mitchell M. An Introduction to Genetic Algorithms Cambridge, MA: MIT Press; 1996.

369. Mitchell T. Machine Learning New York: McGraw-Hill; 1997.

370. Monahan G. “A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms”. Management Science. January 1982;28:1–16.

371. Montague P, Dayan P, Person C, Sejnowski T. “Bee Foraging in Uncertain Environments Using Predictive Hebbian Learning”. Nature. 1995;377:725–728.

372. Moore EF. “The Shortest Path through a Maze”. In: Proceedings of an International Symposium on the Theory of Switching, Part II. Cambridge, MA: Harvard University Press; 1959;285–292.

373. Moore R. “Semantical Considerations on Nonmonotonic Logic”. Artificial Intelligence. 1985;25(l):75–94.

374. Moore R. “A Formal Theory of Knowledge and Action”. In: Hobbs J, Moore R, eds. Formal Theories of the Commonsense World. Norwood, NJ: Ablex; 1985;319–358.

375. Moore R. “Autoepistemic Logic Revisited”. Artificial Intelligence. 1993;59(1–2):27–30.

376. Moore A, Atkeson C. “Prioritized Sweeping-Reinforcement Learning with Less Data and Less Time”. Machine Learning. 1993;13:103–130.

377. Mostow J, Prieditis A. “Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach”. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89). San Francisco: Morgan Kaufmann; 1989;701–707.

378. Muggleton S. Inductive Logic Programming New York: Academic Press; 1992.

379. Muggleton S, Buntine W. “Machine Invention of First-Order Predicates by Inverting Resolution”. In: Laird J, ed. Proceedings of the Fifth International Conference on Machine Learning. San Francisco: Morgan Kaufmann; 1988;339ff.

380. Muggleton S, King R, Sternberg J. “Protein Secondary Structure Prediction Using Logic-Based Machine Learning”. Protein Engineering. 1992;5(7):647–657.

381. Muggleton S, De Raedt L. “Inductive Logic Programming: Theory and Methods”. Journal of Logic Programming. 1994;1920:629–679.

382. Myers K. “Hybrid Reasoning Using Universal Attachment”. Artificial Intelligence. 1994;2(67)):329–375.

383. Nalwa VS. A Guided Tour of Computer Vision Reading, MA: Addison-Wesley; 1993.

384. Nalwa V, Binford T. “On Detecting Edges”. IEEE Trans on Pattern Analysis and Machine Intelligence. November 1986;PAMI–8(6):699–714.

385. Nalwa V, Pauchon E. “Edgel Aggregation and Edge Description”. Computer Vision, Graphics, and Image Processing. 1987;40:79–94.

386. Neal R. “Connectionist Learning of Belief Networks”. Artificial Intelligence. 1991;56:71–113.

387. Neapolitan R. Probabilistic Reasoning in Expert Systems: Theory and Algorithms New York: John Wiley & Sons; 1990.

388. Newborn M. Computer Chess Comes of Age New York: Springer-Verlag; 1996.

389. Newell, A., “The Possibility of Planning Languages in Man-Computer Communication” In Communication Processes, Proceedings of a Symposium held in Washington, 1963, New York: Pergamon, 1964.

390. Newell A. “Production Systems: Models of Control Structures”. In: Chase W, ed. Visual Information Processing. New York: Academic Press; 1973.

391. Newell A. “The Knowledge Level”. Artificial Intelligence. 1982;18(1):87–127.

392. Newell A. Unified Theories of Cognition Cambridge, MA: Harvard University Press; 1991.

393. Newell, A., Shaw, J., and Simon, H., “Empirical Explorations of the Logic Theory Machine,” Proc. West. Joint Computer Conf., vol. 15, pp. 218–239, 1957. (Reprinted in Feigenbaum, E., and Feldman, J. (eds.), Computers and Thought, pp. 109–133, New York: McGraw-Hill, 1963.).

394. Newell A, Shaw JC, Simon HA. “Chess-Playing Programs and the Problem of Complexity”. IBM Jour R & D. 1958;2:320–355.

394. Reprinted in Feigenbaum E, Feldman J, eds. Computers and Thought. New York: McGraw-Hill; 1963.

395. Newell A, Shaw JC, Simon HA. “Report on a General Problem-Solving Program for a Computer”. Computers and Automation. 1959;8(7):10–16.

396. Newell A, Simon H. “GPS, A Program That Simulates Human Thought”. In: Feigenbaum E, Feldman J, eds. Computers and Thought. New York: McGraw-Hill; 1963;279–293. .

397. Newell A, Simon H. Human Problem Solving Englewood Cliffs, NJ: Prentice Hall; 1972.

398. Newell A, Simon HA. “Computer Science as Empirical Inquiry: Symbols and Search”. Communications of the Association for Computing Machinery. 1976;19(3):113–126.

399. Nii HP. “Blackboard Systems: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures”. The AI Magazine. Summer 1986;7(2):38–64.

400. Nii HP. “Blackboard Systems (Part Two): Blackboard Application Systems, Blackboard Systems from a Knowledge Engineering Perspective”. The AI Magazine. 1986;7(3):82–106.

401. Nilsson N. The Mathematical Foundations of Learning Machines San Francisco: Morgan Kaufmann; 1990.

401. This book is a reprint of Nilsson N. Learning Machines: Foundations of Trainable Pattern-Classifying Systems New York: McGraw-Hill; 1965.

402. Nilsson N. “Searching Problem-Solving and Game-Playing Trees for Minimal Cost Solutions”. In: Morrell A, ed. Amsterdam: North-Holland; 1969;1556–1562. Information Processing 68. vol. 2.

403. Nilsson N. Principles of Artificial Intelligence San Francisco: Morgan Kaufmann; 1980.

404. Nilsson N. “Artificial Intelligence, Employment, and Income”. The AI Magazine. Summer 1984;5(2):5–14.

405. Nilsson, N., Shakey the Robot, Technical Note 323, SRI International, Menlo Park, CA, 1984.

406. Nilsson N. “Probabilistic Logic”. Artificial Intelligence. 1986;28(l):71–87.

407. Nilsson N. “Logic and Artificial Intelligence”. Artificial Intelligence. 1991;47:31–56.

408. Nilsson N. “Teleo-Reactive Programs for Agent Control”. Journal of Artificial Intelligence Research. January 1994;1:139–158.

409. Nilsson N, Raphael B. “Preliminary Design of an Intelligent Robot”. In: Tou JT, ed. Computer and Information Sciences-II. New York: Academic Press; 1967;235–259.

410. Norvig P. Paradigms of Artificial Intelligence Programming: Case Studies in Common LISP San Francisco: Morgan Kaufmann; 1992.

411. Nourbakhsh I. Interleaving Planning and Execution for Autonomous Robots Boston: Kluwer Academic Publishers; 1997;.

412. O’Reilly U-M, Oppacher F. “Program Search with a Hierarchical Variable Length Representation: Genetic Programming, Simulated Annealing and Hill Climbing”. In: Davidor Y, Schwefel H, Manner R, eds. Lecture Notes in Computer Science, No 866. Berlin: Springer-Verlag; 1994.

413. Paterson M, Wegman M. “Linear Unification”. Journal of Computer and System Science. 1978;16:158–167.

414. Pearl J. “Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach”. In: Proceedings of the Second National Conference on Artificial Intelligence (AAAI-82). Menlo Park, CA: AAAI Press; 1982;155–156.

415. Pearl J. “A Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and its Optimality”. Comm ACM. 1982;25(8):559–564.

416. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving Reading, MA: Addison–Wesley; 1984.

417. Pearl J. “Fusion, Propagation, and Structuring in Belief Networks”. Artificial Intelligence. 1986;29:241–288.

418. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference San Francisco: Morgan Kaufmann; 1988.

419. Pearl J. “Reasoning under Uncertainty”. In: Palo Alto, CA: Annual Reviews; 1990;37–72. Annual Review of Computer Science. vol. 4 1989–1990.

420. Pednault E. “Formulating Multiagent, Dynamic-World Problems in the Classical Planning Framework”. In: Georgeff M, Lansky A, eds. Reasoning about Actions and Plans: Proceedings of the 1986 Workshop. Timberline, Oregon, San Francisco: Morgan Kaufmann; 1986;47–82.

420. Also in Allen J, Hendler J, Tate A. In: Readings in Planning. San Francisco: Morgan Kaufmann; 1990;675–710.

421. Pednault E. “ADL: Exploring the Middle Ground between STRIPS and the Situation Calculus”. In: Brachman R, Levesque H, Reiter R, eds. Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR-89). San Francisco: Morgan Kaufmann; 1989;324–332.

422. Penberthy J, Weld D. “UCPOP: A Sound, Complete Partial-Order Planner for ADL”. In: Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR-92). San Francisco: Morgan Kaufmann; 1992;103–113.

423. Penrose R. The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics Oxford: Oxford University Press; 1989.

424. Penrose R. Shadows of the Mind: Search for the Missing Science of Consciousness Oxford: Oxford University Press; 1994.

425. Pereira, F., and Shieber, S., PROLOG and Natural Language Analysis, CSLI Lecture Notes, No. 10, Center for the Study of Language and Information, Stanford University, Stanford, CA, 1987.

426. Pereira F, Warren D. “Definite Clause Grammars for Language Analysis: A Survey of the Formalism and a Comparison with Augmented Transition Networks”. Artificial Intelligence. 1980;13:231–278.

427. Perlis D. “Languages with Self-Reference, I: Foundations”. Artificial Intelligence. 1985;25:301–332.

428. Perlis D. “Languages with Self-Reference, II: Knowledge, Belief, and Modality”. Artificial Intelligence. 1988;34:179–212.

429. Perona, P., and Malik, J., “Scale-Space and Edge Detection Using Anisotropic Diffusion,” IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI–12:7:629–639, July 1990.

430. Pineda FJ. “Generalization of Back-Propagation to Recurrent Neural Networks”. Physical Review Letters. 1987;59:2229–2232.

431. Pingle K. “Visual Perception by a Computer”. In: Grasselli A, ed. Automatic Interpretation and Classification of Images. New York: Academic Press; 1969;277–284.

432. Pohl I. “Bi-directional Search”. In: Meitzer B, Michie D, eds. Machine Intelligence 6. Edinburgh: Edinburgh University Press; 1971;127–140.

433. Pohl I. “The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving”. In: Proceedings of the Third International Joint Conference on Artificial Intelligence (IJCAI-73). San Francisco: Morgan Kaufmann; 1973;20–23.

434. Pollack ME, Ringuette M. “Introducing the Tileworld: Experimentally Evaluating Agent Architectures”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;183–189.

435. Pomerleau D. “Rapidly Adapting Artificial Neural Networks for Autonomous Navigation”. In: Lippmann P, ed. Advances in Neural Information Processing Systems, 3. San Francisco: Morgan Kaufmann; 1991;429–435.

436. Pomerleau D. Neural Network Perception for Mobile Robot Guidance Boston: Kluwer Academic Publishers; 1993.

437. Port R, van Gelder T. Mind as Motion: Explorations in the Dynamics of Cognition Cambridge, MA: Bradford Books/MIT Press; 1995.

438. Pospesel H. Introduction to Logic: Predicate Logic Englewood Cliffs, NJ: Prentice Hall; 1976.

439. Powers R. Galatea 2.2 New York: Farrar, Straus & Giroux; 1995;.

440. Powley C, Ferguson C, Korf R. “Depth-First Heuristic Search on a SIMD Machine”. Artificial Intelligence. 1993;60:199–242.

441. Pradhan M, Provan G, Middleton B, Henrion M. “Knowledge Engineering for Large Belief Networks”. In: Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence. San Francisco: Morgan Kaufmann; 1994;484–490.

442. Prawitz D. Natural Deduction: A Proof Theoretical Study Stockholm: Almquist and Wiksell; 1965.

443. Prieditis A. “Machine Discovery of Effective Admissible Heuristics”. Machine Learning. 1993;12(1–3):117–141.

444. Purdom Jr PW, Brown C. “Polynomial Average-Time Satisfiability Problems”. Information Science. 1987;41:23–42.

445. Puterman M. Markov Decision Processes—Discrete Stochastic Dynamic Programming New York: John Wiley & Sons; 1994.

446. Quinlan J. “Discovering Rules from Large Collections of Examples: A Case Study”. In: Michie D, ed. Expert Systems in the Microelectronic Age. Edinburgh: Edinburgh University Press; 1979.

447. Quinlan JR. “Learning Logical Definitions from Relations”. Machine Learning. 1990;5(3):259–266.

448. Quinlan JR. C4.5: Programs for Machine Learning San Francisco: Morgan Kaufmann; 1993.

449. Ramadge P, Wonham M. “The Control of Discrete Event Systems”. Proc of the IEEE. 1989;77(l):81–93.

450. Reichardt W. “On the Theory of Lateral Nervous Inhibition in the Complex Eye of Limulus”. Progress in Brain Research. 1965;17:64–73.

451. Reiter R. “A Logic for Default Reasoning”. Artificial Intelligence. 1980;13(1–2):81–132.

452. Reiter R. “The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression”. In: Lifschitz V, ed. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. New York: Academic Press; 1991;359–380.

453. Reitman W, Wilcox B. “The Structure and Performance of the INTERIM.2 Go Program”. In: Proceedings of the Sixth International Joint Conference on Artificial Intelligence (IJCAI-79). San Francisco: Morgan Kaufmann; 1979;711–719.

454. Resnick M. “Behavior Construction Kits”. Communications of the ACM. July 1993;36(7):64–71.

455. Rich E, Knight K. Artificial Intelligence second edition New York: McGraw-Hill; 1991;.

456. Rissanen J. “Universal Coding, Information, Prediction, and Estimation”. IEEE Transactions on Information Theory. 1984;IT-30(4):629–636.

457. Rivest R. “Learning Decision Lists”. Machine Learning. 1987;2:229–246.

458. Rivest R, Schapire R. “Inference of Finite Automata Using Homing Sequences”. Information and Computation. 1993;103(2):299–347.

459. Roberts, L., Machine Perception of Three-Dimensional Solids, Tech. Report 315, MIT Lincoln Laboratory, Ph.D. dissertation, Massachusetts Institute of Technology, 1963.

460. Robinson JA. “A Machine-Oriented Logic Based on the Resolution Principle”. Journal of the Association for Computing Machinery. 1965;12(1):23–41.

461. Rohwer R, Forrest B. “Training Time-Dependence in Neural Networks”. In: Caudill M, Butler C, eds. San Diego, New York: IEEE; 1987;701–708. IEEE First International Conference on Neural Networks. vol. II.

462. Rosenblatt F. Principles of Neurodynamics Washington, DC: Spartan Books; 1962.

463. Rosenschein S, Kaelbling L. “A Situated View of Representation and Control”. Artificial Intelligence. 1995;73:149–173.

464. The Soar Papers: Research on Integrated Intelligence. vols. 1 and 2. Rosenbloom P, Laird J, Newell A, eds. Cambridge, MA: MIT Press; 1993.

465. Ross S. A First Course in Probability third edition London: Macmillan; 1988.

466. Roussel, P., “PROLOG: Manual de Reference et d’Utilization,” Technical Report, Université Aix-Marseille II, Groupe d’Intelligence Artificielle, France, 1975.

467. Rumelhart, D. E., Hinton, G. E., and Williams, R. J., “Learning Internal Representations by Error Propagation”. In Rumelhart, D. E., and McClelland, J. L. (eds.), Parallel Distributed Processing, Vol 1., pp. 318–362, 1986.

468. Russell S. “Rationality and Intelligence”. Artificial Intelligence. 1997;1(94):57–77.

469. Russell S, Norvig P. Artificial Intelligence: A Modern Approach Englewood Cliffs, NJ: Prentice Hall; 1995; (Revised edition to appear in 1998.).

470. Russell S, Wefald E. Do the Right Thing Cambridge, MA: MIT Press; 1991.

471. Sacerdoti E. “Planning in a Hierarchy of Abstraction Spaces”. Artificial Intelligence. 1974;5(2):115–135 (Reprinted in Allen, J., Hendler, J., and Tate, A. (eds.), Readings in Planning, pp. 98–108, San Francisco: Morgan Kaufmann, 1990.).

472. Sacerdoti, E., “The Non–linear Nature of Plans,” in Proceedings of the Fourth International Joint Conference on Artificial Intelligence (IJCAI-75), pp. 206–214, San Francisco: Morgan Kaufmann, 1975. (Reprinted in Allen, J., Hendler, J., and Tate, A. (eds.), Readings in Planning, pp. 162–170, San Francisco: Morgan Kaufmann, 1990.).

473. Sacerdoti E. A Structure for Plans and Behavior New York: American Elsevier; 1977;.

474. Sadek, M., Ferrieux, A., Cozannet, A., Bretier, P., Panaget, F., and Simonin, J., “Effective Human-Computer Cooperative Spoken Dialogue: The AGS Demonstrator” In Proc. ICSLP’96 International Conf. on Spoken Language Processing, pp. 546–549, Philadelphia, PA, October 3–6, 1996.

475. Samuel AL. “Some Studies in Machine Learning Using the Game of Checkers”. IBM Jour R & D. 1959;3:211–229.

475. Reprinted in Feigenbaum E, Feldman J, eds. Computers and Thought. New York: McGraw-Hill; 1963.

476. Samuel AL. “Some Studies in Machine Learning Using the Game of Checkers II—Recent Progress”. IBM Jour R & D. 1967;11(6):601–617.

477. Schaeffer J. One Jump Ahead: Challenging Human Supremacy in Checkers New York: Springer-Verlag; 1997.

478. Schaeffer J, Culberson J, Treloar N, Knight B, Lu P, Szafron D. “A World Championship Caliber Checkers Program”. Artificial Intelligence. 1992;53(2–3):273–289.

479. Schaeffer J, Lake R. “Solving the Game of Checkers”. In: Nowakowski RJ, ed. Games of No Chance. Cambridge: Cambridge University Press; 1996;119–133.

480. Scherl R, Levesque H. “The Frame Problem and Knowledge Producing Actions”. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Menlo Park, CA: AAAI Press; 1993;689–695.

481. Schoppers MJ. “Universal Plans for Reactive Robots in Unpredictable Domains”. In: Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87). San Francisco: Morgan Kaufmann; 1987;1039–1046.

482. Schraudolph N, Dayan P, Sejnowski T. “Temporal Difference Position Evaluation in the Game of GO”. In: Cowan J, ed. Advances in Neural Information Processing Systems, 6. San Francisco: Morgan Kaufmann; 1994;817–824.

483. Schubert L. “Monotonie Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds with Fully Specified Actions”. In: Kyberg H, Loui R, Carlson G, eds. Knowledge Representation and Defeasible Reasoning. Boston: Kluwer Academic Publishers; 1990;23–67.

484. Schultz W, Dayan P, Montague PR. “A Neural Substrate for Prediction and Reward”. Science. March 14, 1997;275:1593–1599.

485. Schwartz J. “The Limits of Artificial Intelligence”. Encyclopedia of Artificial Intelligence New York: John Wiley & Sons; 1987;.

486. Searle J. Speech Acts: An Essay in the Philosophy of Language Cambridge: Cambridge University Press; 1969.

487. Searle J. “Minds, Brains, and Programs”. The Behavioral and Brain Sciences. 1980;3:417–457.

487. (with open peer commentary). Reprinted in Hofstadter DR, Dennett DC, eds. The Mind’s Eye: Fantasies and Reflections on Self and Soul. New York: Basic Books; 1981.

488. Searle J. The Rediscovery of the Mind Cambridge, MA: MIT Press; 1992.

489. Sejnowski T, Rosenberg C. “Parallel Networks That Learn to Pronounce English Text”. Complex Systems. 1987;1:145–168.

490. Selman B, Kautz H. “Knowledge Compilation Using Horn Approximations”. In: Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91). Menlo Park, CA: AAAI Press; 1991;904–909.

491. Selman B, Kautz H. “An Empirical Study of Greedy Local Search for Satisfiability Testing”. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Menlo Park, CA: AAAI Press; 1993;46–51.

492. Selman B, Kautz H, Cohen B. “Noise Strategies for Improving Local Search”. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94). Menlo Park, CA: AAAI Press; 1994;337–343.

493. Selman B, Kautz H, Cohen B. “Local Search Strategies for Satisfiability Testing”. In: Du D, Gu J, Pardalos P, eds. Satisfiability Problem: Theory and Applications, Vol 35, Dimacs Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society; 1996.

494. Selman B, Levesque H. “Abductive and Default Reasoning: A Computational Core”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;343–348.

495. Selman B, Levesque H, Mitchell D. “A New Method for Solving Hard Satisfiability Problems”. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Menlo Park, CA: AAAI Press; 1992;440–446.

496. Shachter R, Kenley C. “Gaussian Influence Diagrams”. Management Science. 1989;35:527–550.

497. Shafer G. A Mathematical Theory of Evidence Princeton, NJ: Princeton University Press; 1979.

498. Shafer G, Pearl J, eds. Readings in Uncertain Reasoning. San Francisco: Morgan Kaufmann; 1990.

499. Shanahan M. Solving the Frame Problem: A Mathematical Investigation of the Commonsense Law of Inertia Cambridge, MA: MIT Press; 1997;.

500. Shannon C. “Programming a Computer for Playing Chess,“. Philosophical Magazine (Series 7). 1950;41:256–275.

501. Shannon C, McCarthy J, eds. Automata Studies, Annals of Mathematical Studies. Princeton, NJ: Princeton University Press; 1956.

502. Shapiro S. In: New York: John Wiley & Sons; 1992; Encyclopedia of Artificial Intelligence. Vols. 1 and 2.

503. Shavlik J, Dietterich T, eds. Readings in Machine Learning. San Francisco: Morgan Kaufmann; 1990.

504. Shen W-M. Autonomous Learning from the Environment San Francisco: W. H. Freeman; 1994.

505. Shirai Y. Three-Dimensional Computer Vision Berlin: Springer-Verlag; 1987.

506. Shoham Y. “Temporal Logics in AI: Semantical and Ontological Considerations”. Artificial Intelligence. 1987;33(1):89–104.

507. Shoham Y. Reasoning about Change: Time and Causation from the Standpoint of Artificial Intelligence Cambridge, MA: MIT Press; 1988.

508. Shoham Y. “Agent-Oriented Programming”. Artificial Intelligence. 1993;60:51–92.

509. Shoham Y. AI Programming in PROLOG San Francisco: Morgan Kaufmann; 1994.

510. Shoham Y. “The Open Scientific Borders of AI, and the Case of Economics”. ACM Computing Surveys. December 1996;28(4):11.

511. Shortliffe EH. Computer-Based Medical Consultations: MYCIN New York: Elsevier; 1976.

512. Shrobe H, ed. Exploring Artificial Intelligence: Survey Talks from the National Conference on Artificial Intelligence. San Francisco: Morgan Kaufmann; 1988.

513. Skolem, T., “Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit Mathematischer Sätze Nebst einem Theoreme über die Dichte Mengen,” Videnskapsselskapets Skrifter, I, Matematisk-naturvidenskabelig Klasse, 4, 1920.

514. Slate D, Atkin L. “Chess 4.5—The Northwestern University Chess Program”. In: Fry P, ed. Chess Skill in Man and Machine. New York: Springer-Verlag; 1977;82–118.

515. Slagle JR. “A Heuristic Program That Solves Symbolic Integration Problems in Freshman Calculus”. Jour Assoc of Comp Mach. 1963;10:507–520.

515. Also in Feigenbaum E, Feldman J, eds. Computers and Thought. New York: McGraw-Hill; 1963.

516. Slagle J, Dixon J. “Experiments with Some Programs that Search Game Trees”. Jour Assoc Comp Mach. 1969;162:189–207.

517. Smith DE. “Controlling Backward Inference”. Artificial Intelligence. 1989;39(2):145–208.

518. Smith DE, Genesereth M, Ginsberg M. “Controlling Recursive Inference”. Artificial Intelligence. 1986;30(3):343–389.

519. Soderland, S., and Weld, D., “Evaluating Nonlinear Planning,” Technical Report TR–91–02–03, University of Washington Department of Computer Science and Engineering, Seattle, WA, 1991.

520. Sowa J, ed. Principles of Semantic Networks. San Francisco: Morgan Kaufmann; 1991.

521. Spirtes P, Meek C. “Learning Bayesian Networks with Discrete Variables from Data”. In: Proceedings of First International Conference on Knowledge Discovery and Data Mining. San Francisco: Morgan Kaufmann; 1995.

522. Stallman R, Sussman G. “Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis”. Artificial Intelligence. 1977;9(2):135–196.

523. Stanfill C, Waltz D. “Toward Memory-Based Reasoning”. Communications of the ACM. 1986;29(12):1213–1228.

524. Stefik M. Introduction to Knowledge Systems San Francisco: Morgan Kaufmann; 1995.

525. Stentz A. “The Focussed D* Algorithm for Real–Time Replanning”. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). San Francisco: Morgan Kaufmann; 1995;1652–1659.

526. Stentz A, Hebert M. “A Complete Navigation System for Goal Acquisition in Unknown Environments”. Autonomous Robots. 1995;2(2):127–147.

527. Sterling L, Shapiro E. The Art of PROLOG Cambridge, MA: MIT Press; 1986.

528. Stickel M. “Automated Deduction by Theory Resolution”. Journal of Automated Reasoning. 1985;1(4):333–355.

529. Stickel M. “A PROLOG Technology Theorem Prover: Implementation by an Extended PROLOG Compiler”. Journal of Automated Reasoning. 1988;4:353–380.

530. Stickel M, Tyson M. “An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction”. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85). San Francisco: Morgan Kaufmann; 1985;1073–1075.

531. Strat T. Natural Object Recognition Berlin: Springer-Verlag; 1992.

532. Sussman G. A Computa Model of Skill Acquisition Amsterdam: Elsevier/North-Holland; 1975.

533. Sutton R. “Learning to Predict by the Methods of Temporal Differences”. Machine Learning. 1988;3:9–44.

534. Sutton R. “Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming”. In: Proceedings of the Seventh International Conference on Machine Learning. San Francisco: Morgan Kaufmann; 1990;216–224. .

535. Tarski A. “Die Wahrheitsbegriff in den Formalisierten Sprachen”. Studia Philosophica. 1935;1:261–405.

536. Tarski A. Logic, Semantics, Metamathematics: Papers from 1923 to 1938 Oxford: Oxford University Press; 1956.

537. Tate A. “Generating Project Networks”. In: Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI-77). San Francisco: Morgan Kaufmann; 1977;888–893. Reprinted in.

537. Allen J, Hendler J, Tate A, eds. Readings in Planning. San Francisco: Morgan Kaufmann; 1990.

538. Tate A, ed. Advanced Planning Technology, The Technological Achievements of the ARPA/Rome Laboratory Planning Initiative. Menlo Park, CA: AAAI Press; May 1996.

539. Teller A. “The Evolution of Mental Models”. In: Kinnear Jr K, ed. Advances in Genetic Programming. Cambridge, MA: MIT Press; 1994; Ch. 9.

540. Tenenberg J. “Abstraction in Planning”. In: Allen J, Kautz H, Pelavin R, Tenenberg J, eds. Reasoning about Plans. San Francisco: Morgan Kaufmann; 1991; Ch. 4.

541. Tesauro G. “Practical Issues in Temporal Difference Learning”. Machine Learning. 1992;8(3/4):257–277.

542. Tesauro G. “Temporal-Difference Learning and TD-Gammon”. Comm ACM. March 1995;38(3):58–68.

543. Theraulaz G, Bonabeau E. “Coordination in Distributed Building”. Science. August 4, 1995;269:686–688.

544. Thorpe C, Hebert M, Kanade T, Shafer S. “The New Generation System for the CMU Navlab”. In: Masaki I, ed. Vision-Based Vehicle Guidance. Berlin: Springer-Verlag; 1992;30–82.

545. Towell G, Shavlik J. “Interpretation of Artificial Neural Networks: Mapping Knowledge-Based Neural Networks into Rules”. In: Moody J, Hanson S, Lippmann R, eds. Advances in Neural Information Processing Systems, 4. San Francisco: Morgan Kaufmann; 1992;977–984.

546. Towell G, Shavlik J, Noordweier M. “Refinement of Approximate Domain Theories by Knowledge-Based Artificial Neural Networks”. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90). Menlo Park, CA: AAAI Press; 1990;861–866.

547. Tracy K, Bouthoorn P. Object-Oriented Artificial Intelligence Using C++ New York: Computer Science Press; 1997.

548. Trappl R. Impacts of Artificial Intelligence: Scientific, Technological, Military, Economic, Societal, Cultural, and Political New York: North-Holland; 1986;.

549. Turing AM. “Computing Machinery and Intelligence”. Mind. 1950;59:453–460.

549. Reprinted in Feigenbaum E, Feldman J, eds. Computers and Thought. New York: McGraw-Hill; 1963.

550. Tversky A, Kahneman D. “Causal Schemata in Judgements under Uncertainty”. In: Kahneman D, Slovic P, Tversky A, eds. Judgements under Uncertainty: Heuristics and Biases. Cambridge: Cambridge University Press; 1982.

551. Ullman JD. Principles of Database and Knowledge-Base Systems, Vol I: Classical Database Systems New York: Computer Science Press; 1988.

552. Ullman JD. Principles of Database and Knowledge-Base Systems, Vol II: The New Technologies New York: Computer Science Press; 1989.

553. Unger S. The Essence of Logic Circuits Englewood Cliffs, NJ: Prentice Hall; 1989.

554. Venn J. “On the Diagrammatic and Mechanical Representation of Propositions and Reasonings”. Phil Mag. 1880;123.

555. Waibel A, Lee K-F, eds. Readings in Speech Recognition. San Francisco: Morgan Kaufmann; 1990.

556. Waibel, A., Hanazawa, T., Hinton, G., Shikano, K., and Lang, K., “Phoneme Recognition: Neural Networks versus Hidden Markov Models” In Proc. of the International Conf. on Acoustics, Speech and Signal Processing, New York, 1988.

557. Waldinger R. “Achieving Several Goals Simultaneously”. In: Elcock E, Michie D, eds. Machine Intelligence 8. Chichester, England: Ellis Horwood; 1975;94–138.

558. Walter G. The Living Brain New York: Norton and Company; 1953.

559. Waltz D. “Understanding Line Drawings of Scenes with Shadows”. In: Winston P, ed. The Psychology of Computer Vision. New York: McGraw-Hill; 1975;19–91.

560. Wang X. “Learning by Observation and Practice: An Incremental Approach for Planning Operator Acquisition”. In: Proceedings of the Twelfth International Conference on Machine Learning. San Francisco: Morgan Kaufmann; 1995;549–557.

561. Warren D, Pereira L, Pereira F. “PROLOG: The Language and Its Implementation Compared with LISP”. SIGPLAN Notices. 1977;12(8):109–115.

562. Weiss S, Kulikowski C. Computer Systems That Learn San Francisco: Morgan Kaufmann; 1991.

563. Weizenbaum J. “ELIZA—A Computer Program for the Study of Natural Language Communication between Man and Machine”. Communications of the Association for Computing Machinery. 1965;9(1):36–45.

564. Weizenbaum J. Computer Power and Human Reason: From Judgment to Calculation New York: W. H. Freeman; 1976.

565. Weld D. “An Introduction to Least Commitment Planning”. AI Magazine. 1994;15(4):27–61.

566. Weld D, de Kleer J. Readings in Qualitative Reasoning about Physical Systems San Francisco: Morgan Kaufmann; 1990.

567. Wellman M. “Fundamental Concepts of Qualitative Probabilistic Networks”. Artificial Intelligence. 1990;44:257–303.

568. Wellman M. “Market-Oriented Programming: Some Early Lessons”. In: Clearwater S, ed. Market-Based Control—A Paradigm for Distributed Resource Allocation. Singapore: World Scientific; 1996.

569. Werbos, P., Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences, Ph.D. Thesis, Harvard University, 1974.

570. Weyhrauch R. “Prolegomena to a Theory of Mechanized Formal Reasoning”. Artificial Intelligence. 1980;13(1–2):133–170.

571. Whitehead S, Karlsson J, Tenenberg J. “Learning Multiple Goal Behavior via Task Decomposition and Dynamic Policy Merging”. In: Connell J, Mahadevan S, eds. Robot Learning. Boston: Kluwer Academic Publishers; 1993; Ch. 3.

572. Widrow, B., and Hoff, M. E., “Adaptive Switching Circuits,” 1960 IRE WESCON Convention Record, pp. 96–104, New York, 1960.

573. Widrow B. “Generalization and Information Storage in Networks of Adaline ‘Neurons,’ “. In: Yovitz M, Jacobi G, Goldstein G, eds. Self-Organizing Systems 1962. Washington, DC: Spartan Books; 1962;435–461.

574. Wiener N. Cybernetics: Control and Communication in the Animal and in the Machine New York: John Wiley & Sons; 1948.

575. Wilkins DE. Practical Planning: Extending the Classical AI Planning Paradigm San Francisco: Morgan Kaufmann; 1988.

576. Wilkins DE, Myers K, Lowrance J, Wesley L. “Planning and Reacting in Uncertain and Dynamic Domains”. Journal of Experimental and Theoretical Artificial Intelligence. 1995;7(l):197–227.

577. Wilson S. “The Animât Path to AI”. In: Meyer JA, Wilson S, eds. From Animals to Animats; Proceedings of the First International Conference on the Simulation of Adaptive Behavior. Cambridge, MA: MIT Press/Bradford Books; 1991.

578. Winograd T. Understanding Natural Language New York: Academic Press; 1972;.

579. Winograd T, Flores F. Understanding Computers and Cognition: A New Foundation for Design Norwood, NJ: Ablex; 1986; (Four reviews and a response appear in Artificial Intelligence, 31(2): 213–261, 1987.).

580. Wooldridge D. Mechanical Man: The Physical Basis of Intelligent Life New York: McGraw-Hill; 1968.

581. Woods W. “Transition Network Grammars for Natural Language Analysis”. Communications of the Association for Computing Machinery. 1970;13(10):591–606.

582. Woods, W., “Progress in Natural Language Understanding: An Application to Lunar Geology”. In AFIPS Conf Proc., vol. 42, pp. 441–450, 1973.

583. Wos L. “Automated Reasoning Answers Open Questions”. Notices of the AMS. January 1993;5(1):15–26.

584. Wos L, Carson D, Robinson G. “Efficiency and Completeness of the Set-of-Support Strategy in Theorem Proving”. Journal of the Association for Computing Machinery. 1965;12:536–541.

585. Wos L, Robinson G. “Paramodulation and Set of Support”. In: Proc of the IRIA Symposium on Automatic Demonstration. Berlin: Springer-Verlag; 1968;276–310.

586. Wos L, Winker S. “Open Questions Solved with the Assistance of AURA”. In: Bledsoe W, Loveland D, eds. Automated Theorem Proving: After 25 Years: Proceedings of the Special Session of the 89th Annual Meeting of the American Mathematical Society. Denver, Colorado: American Mathematical Society; 1983;71–88.

587. Wos L, Overbeek R, Lusk E, Boyle J. Automated Reasoning: Introduction and Applications second edition New York: McGraw-Hill; 1992.

588. Zadeh L. “Fuzzy Logic and Approximate Reasoning”. Synthese. 1975;30:407–428.

589. Zadeh L. “Fuzzy Sets as a Basis for a Theory of Possibility”. Fuzzy Sets and Systems. 1978;1:3–28.

590. Zhu, S. C., Wu, Y., and Mumford, D., “FRAME: Filters, Random Fields, and Maximum Entropy Towards a Unified Theory for Texture Modeling,” Int’l Journal of Computer Vision, to appear.

591. Zobrist, A. Feature Extraction and Representation for Pattern Recognition and the Game of Go, Ph.D. Dissertation, University of Wisconsin, 1970.

592. Zweben M, Fox M, eds. Intelligent Scheduling. San Francisco: Morgan Kaufmann; 1994.