for factories and warehouses, medical diagnosis systems, systems that will automate a large amount of office work, legal aids, teaching aids, interactive software production systems, and so on. [Firschein et al. (1973), make some predictions about when these and other intelligent systems may come.] The short range result of this increased pragmatism may tend to fractionate the field. In the long run, though, if there really are many more core ideas to be discovered, these technological efforts will stimulate their discovery, provided that a sufficient level of basic investigation continues. In closing, I have one final prediction. As AI successes grow, so will the criticisms of AI, especially from those who are certain that intelligence cannot be mechanized. These critics, having been forced out of various mystical trenches in the past, will be especially vigorous in their defense of what little ground remains to them. The ensuing debates will have the crucially important side effect of getting us all to consider how we want to use and control our new intellectual powers. I hope that society assesses these powers accurately and is not lulled by certain otherwise well-meaning humanists into believing that Artificial Intelligence is not real. ACKNOWLEDGMENTS I am grateful for the comments and criticisms of the following people: Woodrow Bledsoe, Stephen Coles, Edward Feigenbaum, Jerome Feldman, Richard Fikes, Cordell Green, Peter Hart, Michael Kassler, John McCarthy, Allen Newell, Charles Rosen, Earl Sacerdoti, Jay Tenenbaum, Richard Waldinger, and Donald Walker. BIBLIOGRAPHY Each entry has a code symbol or symbols associated with one or more of the twelve subheadings of AI that we have discussed in the paper. These symbols are: DED Common-Sense Reasoning, Deduction, and Problem Solving; REP = Modeling and Representation of Knowledge; SEARCH = Heuristic Search; SYS = AI Systems and Languages; GAME = Game Playing; AIDS = Math, Science, and Engineering Aids; TP Automatic Theorem Proving; PROG= Automatic Programming; ROB = Robots; VIS = Machine Vision; LANG= Natural Language Systems; PSYC Information Processing Psychology. A prefix "-G" after a symbol means that the reference contains a general discussion or survey. Agin, Gerald J. and Binford, Thomas 0. (1973), Andrews, P. B. (1968), "Resolution with Merging," Banerji, R. B. (1969), Theory of Problem Solving, Banerji, R. B. and Ernst, G. W. (1972), "Strategy Barnett, Jeffrey (1972), "A Vocal Data Management Bartlett, F. C. (1958), Thinking, Basic Books, New Bartlett, F. C. (1932), Remembering, Cambridge Univ. Becker, J. D. (1970), "An Information-Processing Model of Intermediate-Level Cognition," Memo No. 119, Stanford Artificial Intelligence Project, Computer Science Dept., Stanford Univ., Stanford, CA. Also Report No. 2335, Bolt, Beranek, and Newman, Inc., Cambridge, MA. (PSYC) Becker, J. D. (1973), "A Model for the Encoding of Experiential Information," Computer Models of Thought and Language, Schank and Colby, eds., W. H. Freeman and Co., San Francisco, 1973. (PSYC) Berlekamp, E. (1963), "Program for Double-Dummy Bridge Problems, A Strategy for Mechanical Game Playing," J. ACN, Vol. 10, No. 3, 357-364, July 1963. (GAME) Berliner, Hans (1970), "Experiences Gained in Constructing and Testing a Chess Program," Proc. IEEE Systems Science and Cybernetics Conf., 216-223, Pittsburgh, PA, Oct. 1970. (GAME) Berliner, Hans J. (1973), "Some Necessary Conditions for a Master Chess Program," Adv. Papers 3d Intl. Conf. on Artificial Intelligence, Stanford Univ., Stanford, CA, Aug. 1973. (GAME) Bernstein, A. et al. (1959), "A Chess Playing Program for the IBM 704," Proc. Western Joint Comp. Conf. AIEE, 157-159, Mar. 1959. (GAME) Blair, F. W., Griesmer, J. H., and Jenks, R. D. Bledsoe, W. W. (1971), "Splitting and Reduction Heuristics in Automatic Theorem Proving," Artificial Intelligence, Vol. 2, No. 1, 55-77, Spring 1971. (TP) " Bledsoe, W. W., Boyer, R. S., and Henneman, W. H. (1972), "Computer Proofs of Limit Theorems," Artificial Intelligence, Vol. 3, 27-60, 1972. (TP) Bledsoe, W. W. and Bruel, P. (1973), "A Man-Machine Theorem Proving System," Adv. Papers 3d Intl. Conf. on Artificial Intelligence, Stanford Univ., Stanford, CA, 1973. (TP) Bobrow, D. G. (1964a), "Natural Language Input for a Bobrow, D. G. and Wegbreit, B. (1973b), "A Model and Boyer, Robert S. and Moore, J Strother (1973), Bruce, Bertram (1972), "A Model for Temporal References and Its Application in a Question Answering Program," Artificial Intelligence, Vol. 3, 1-26, 1972. (REP) Bruner, J. S., Goodnow, J. J., and Austin, G. A. Buchanan, B. G., Sutherland, G., and Feigenbaum, E. Buchanan, B. G. and Lederberg, J. (1971), "The Buchanan, J. R. and Luckham, D.. C. (1974), "On Bundy, Alan (1973), "Doing Arithmetic with Diagrams," Chang, C. L. and Lee R. C. (1973), Symbolic Logic Charniak, E. C. (1972), "Toward a Model of Children's Chase, W. G. (1973), Visual Information Processing, Chomsky, N. (1956), "Three Models for the Descrip- Chomsky, N. (1965), Aspects of the Theory of Syntax, Colby, K. M. and Enea, H. (1967), "Heuristic Methods Collins, A. M. and Quillian, M. R. (1972), "Retrieval Time from Semantic Memory," J. Verbal Learning and Verbal Behavior, Vol. 8, 240-247, 1969. (PSYC) Collins, N. and Michie, D., eds. (1968), Machine Intelligence, Vol. 1, American Elsevier Publishing Company, New York, 1967. (GEN) Corey, E. J. (1969), "Computer-Assisted Design of Complex Organic Synthesis," Science, 10 Oct. 1969. (AIDS) Dale, E. and Nichie, D., eds. (1968), Machine Intelligence, Vol. 2, American Elsevier Publishing Company, New York, 1968. (GEN) Darlington, J. L. (1971), "A Partial Mechanization of Second-Order Logic," Machine Intelligence, Vol. 6, 91-100,. B. Meltzer and D. Michie, eds., Edinburgh Univ. Press, Edinburgh. (TP) Davies, D. J. N. (1971), "POPLER: A POP-2 Planner," Nemo MIP-R-89, School of Artificial Intelligence, Univ. of Edinburgh. (SYS) Davis, M. and Putnam, H. (1960), "A Computing Procedure for Quantification Theory," J. ACM, Vol. 7, 201-215, 1960. (TP) Derksen, J., Rulifson, J. F., and Waldinger, R. J. (1972), "The QA4 Language Applied to Robot Planning," AFIPS Conf. Proc., Vol. 41, Part II, 1181-1187, Fall Joint Comp. Conf., 1972. (DED) Deutsch, L. P. (1973), "An Interactive Program Verifier," Ph.D. thesis, Dept. of Computer Science, Univ. of California, Berkeley, 1973. (PROG) Doran, J. and Michie, D. (1966), "Experiments with the Graph Traverser Program," Proc. Roy. Soc. A, Vol. 294, 235-259, 1966. (SEARCH) Dreyfus, H. (1965), "Alchemy and Artificial Intelligence," RAND Corporation Paper P3244 (AD 625 719), Dec. 1965. (GEN) Dreyfus, H. L. (1972), What Computers Can't Do, (GEN) Duda, R. and Hart, P. (1970), "Experiments in Scene Duda, R. and Hart, P. (1973), Pattern Classification and Scene Analysis, John Wiley & Sons, New York, -1973. (VIS-G) Eastman, C. M. (1971a), "GSP: A System for Computer Edmundson, H. P., ed. (1961), Proc. of the Natl. Elspas, B. (1972), "The Semiautomatic Generation of Elspas, B. et al. (1973), "Design of an Interactive Engelman, C. (1969), "MATHLAB 68," Information Ernst, G. W. and Newell, Allen (1969), GPS: A Case Ernst, G. W. (1971), "The Utility of Independent Ernst, H. (1961), "MH-1, A Computer-Operated Mechanical Hand," D. Sc. dissertation, Dept. of Elec. Eng., MIT, Cambridge, MA. (ROB) Fahlman, S. (1973), "A Planning System for Robot Falk, G. (1970), "Computer Interpretation of Im- E. A. Feigenbaum and J. Feldman, eds., 297-309, McGraw-Hill Book Company, New York, 1963. (PSYC) Feigenbaum, E. (1963), "Artificial Intelligence Research," IEEE Trans. Info. Theory, Vol. IT-9. No. 4, 248-261, Oct. 1963. (GEN) Feigenbaum, E. (1969), "Artifical Intelligence: Themes in the Second Decade," Information Processing 68, Vol. 2, A.J.H. Morrell, ed., 1008-1022, NorthHolland Publishing Company, Amsterdam, 1969. Also printed as Stanford Univ. Artificial Intelligence Project Memo No. 67, 15 Aug. 1968. (GEN) Feigenbaum, E. and Feldman, J., eds. (1963), Computers and Thought, McGraw-Hill Book Company, New York, 1963. (GEN) Feldman, J. A. et al. (1969), "The Stanford Hand-Eye Feldman, J. A. et al. (1971), "The Use of Vision and Feldman, J. A. and Rovner, P. D. (1969), "An ALGOL- Fikes, R. E. (1968), "A Heuristic Program for Solving Problems Stated as Nondeterministic Procedures," Ph.D. thesis, Carnegie-Mellon Univ., 1968. (DED, SYS) Fikes, R. E. (1970), "REF-ARF: A System for Solving Problems Stated as Procedures," Artificial Intelligence, Vol. 1(1), 1970. (DED, SYS) Fikes, R. E. and Nilsson, N. J. (1971), "STRIPS: A New Approach to the Application of Theorem Proving in Problem Solving," Artificial Intelligence, Vol. 2, 189-208, 1971. (REP, DED) Fikes, R. E., Hart, P. E., and Nilsson, N. J. (1972a), "Learning and Executing Generalized Robot Plans," Artificial Intelligence, Vol. 3, 251-288, --1972. (DED) Fikes, R. E., Hart, P. E., and Nilsson, N. J. (1972b), "Some New Directions in Robot Problem Solving," B. Meltzer and D. Michie, eds., Machine Intelligence, Vol. 7, Edinburgh Univ. Press, Edinburgh, 1972. (ROB-G) Firschein, Oscar et al. (1973), "Forecasting and Assessing the Impact of Artificial Intelligence on Society," Adv. Papers 3d Intl. Conf. on Artificial Intelligence, Stanford Univ., Stanford, CA, Aug. 1973. (GEN) Fischler, Martin A. and Elschlager, Robert A. (1973), "The Representation and Matching of Pictorial Structures," IEEE Trans. on Computers, Vol. C-22, No. 1, 67-92, Jan. 1973. (VIS) Flanagan, J. L. (1965), Speech Analysis, Synthesis and Perception, Academic Press, New York. Floyd, R. W. (1967), "Assigning Meanings to Programs," Proc. of a Symposium in Applied Mathematics, Vol. 19, J. T. Schwartz, ed., Am. Math. Soc., 19-32, 1967. (PROG) (LANG) Forsen, G. (1968), "Processing Visual Data with an Automaton Eye," Pictorial Pattern Recognition, 471-502, Thompson Book Co., Washington, D. C., 1968. (VIS) Friedman, Joyce (1971), A Computer Model of Trans- Fuller, S., Gaschnig, J., and Gillogly, J. (1973), Scheduling," Management Science, Vol. 13, 167-190. (AIDS) Gillogly, J. (1972), "The Technology Chess Program," Goldstein, A. Jay, Harmon, Leon D., and Lesk, Ann B. Good, D. I. and London, R. L. (1968), "Interval Arithmetic for the Burroughs B5500: Four ALGOL Procedures and Proofs of Their Correctness," Comp. Sci. Tech. Report No. 26, Univ. of Wisconsin, 1968. (PROG) Gordon, G. (1969), System Simulation, Prentice-Hall, Englewood Cliffs, NJ, 1969. (SYS) Grape, G. (1973), "Model Based (Intermediate Level) Computer Vision," Ph.D. thesis, Comp. Sci. Dept., Stanford Univ., Stanford, CA, 1973. (VIS) Greenblatt, R. et al. (1967), "The Greenblatt Chess Program," Proc. AFIPS Fall Joint Comp. Conf., 801810, 1967. (GAME) Green, B. F. et al. (1961), "Baseball: An Automatic Question Answerer," Proc. Western Joint Comp. Conf., 219-224. (LANG) Green, C. (1969a), "Theorem-Proving by Resolution as a Basis for Question-Answering Systems," Machine Intelligence, Vol. 4, B. Meltzer and D. Michie, eds., 183-205, American Elsevier Publishing Company, New York, 1969. (REP, DED) Green, C. (1969b), "The Application of Theorem-Proving to Question-Answering Systems," Doctoral dissertation, Elec. Eng. Dept., Stanford Univ., Stanford, CA, June 1969. Also printed as Stanford Artificial Intelligence Project Memo AI-96, June 1969. (REP, DED, PROG, TP) Green, C. (1969c), "Application of Theorem-Proving to Problem Solving," Proc. Intl. Joint Conf. Artificial Intelligence, Donald E. Walker and Lewis M. Norton, eds., Washington, D.C., May 1969. (REP, DED) Gregory, R. L. (1966), Eye and Brain, McGraw-Hill Gregory, R. L. (1970), The Intelligent Eye, Weidenfeld Griffith, A. K. (1973), "Mathematical Models for Automatic Line Detection," J. ACM, 62-80, 1973. (VIS) Gross, Louis N. and Walker, Donald E. (1969), "OnLine Computer Aids for Research in Linguistics," Information Processing, Vol. 68, A. J. H. Morrell, ed., North-Holland Publishing Company, Amsterdam, 1969. (LANG) Guard, J. R. et al. (1969), "Semi-Automated Mathe- Guzman, A. (1971), "Analysis of Curved Line Drawings Harris, Z. (1961), String Analysis of Sentence Structure, Nouton, The Hague, 1961. (LANG) Hayes, P. (1971), "A Logic of Action," Machine Hayes, P. F. (1973), "The Frame Problem and Related Hearn, A. C. (1968), "REDUCE, A User-Oriented Interactive System for Algebraic Simplification," Interactive Systems for Experimental Applied Mathematics, 79-90, M. Klerer and J. Reinfelds, eds., Academic Press, New York and London, 1968. (AIDS) Hearn, Anthony C. (1971), "REDUCE 2: A System and Language for Algebraic Manipulation," Proc. ACM 2d Symposium on Symbolic and Algebraic Manipulation, S. R. Petrick, ed., 23-25 Mar. 1971, Los Angeles, CA. (AIDS) Hendrix, G. (1973), "Modeling Simultaneous Actions and Continuous Processes," Artificial Intelligence, Vol. 4, 145-180, 1973. (REP) Hendrix, Gary G., Thompson, Craig W., and Slocum, Hewitt, C. (1969), "PLANNER: A Language for Proving Hewitt, C. (1971), "Procedural Embedding of Knowledge Analysis (Using Schemata) of PLANNER: A Language for Proving Theorems and Manipulating Models in a Robot," Ph.D. thesis, Dept. of Math., MIT, Cambridge, MA, 1972. (SYS, REP, DED) Hewitt, C., Bishop, P., and Steiger, R. (1973), "A Universal Modular Actor Formalism for Artificial Intelligence," Adv. Papers 3d Intl. Conf. on Artificial Intelligence, Stanford Univ., Stanford, CA, Aug. 1973. (SYS) Hintzman, D. L. (1968), "Explorations with a Discrimination Net Model for Paired-Associate Learning," J. Mathematical Psychology, Vol. 5, 123-162, 1968. (PSYC) Horn, B. K. P. (1970), "Shape from Shading: A Method for Obtaining the Shape of a Smooth Opaque Object from One View," MAC Tech. Report 79, Project MAC, MIT, Cambridge, MA, Nov. 1970. (VIS) Horn, B. K. P. (1971), "The Binford-Horn Line Finder," Huet, G. P. (1973a), "A Unification Algorithm for Huet, G. P. (1973b), "A Mechanization of Type Theory," Huffman, D. A. (1971), "Impossible Objects as Nonsense Hunt, E. B. (1962), Concept Formation, John Wiley & Hunt, E. B. (1974), Artificial Intelligence, Academic Hunt, E. B. and Hovland, C. I. (1961), "Programming Jackson, P. C. (1974), Introduction to Artificial Kaplan, R. M. (1972), "Augmented Transition Networks as Psychological Models of Sentence Comprehension," Artificial Intelligence, Vol. 3, 77-100, 1972. (PSYC) Kaplan, R. M. (1973), "A General Syntactic Processor," Natural Language Processing, R. Rustin, ed., 293241, Algorithmic Press, New York, 1973. (LANG) Katz, S. M. and Manna, Z. (1973), "Heuristic Approach to Program Verification," Adv. Papers 3d Intl. Conf. on Artificial Intelligence, 500-512, Stanford Univ., Stanford, CA, Aug. 1973. (PROG) Kay, Martin (1964), "A General Procedure for Rewriting Strings," presented at the 1964 Annual Meeting, Association for Machine Translation and Computational Linguistics, Indiana Univ., Bloomington. (LANG) Kay, Martin (1967), "Experiments with a Powerful Parser," RM-5452-PR, RAND Corporation, Santa Monica, CA, 1967. (LANG) Kay, Martin (1973), "The Mind System," Natural Language Processing, R. Rustin, ed., 155-187, Courant Computer Science Symposium 8, 20-21 Dec., Algorithmics Press, Inc., New York, 1973. (LANG) Kelly, M. (1970), "Visual Identification of People by Computer," Memo AI-130, Comp. Sci. Dept., Stanford Univ., Stanford, CA, July 1970. (VIS) King, J. (1969), "A Program Verifier," Doctoral dissertation, Comp. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, PA, 1969. (PROG) Kister, J. et al. (1957), "Experiments in Chess," (GAME) J. ACM, Vol. 4, 174-177, Apr. 1957. Kling, R. E. (1971), "A Paradigm for Reasoning by Analogy," Artificial Intelligence, Vol. 2, No. 2, 147-178, Fall 1971. (DED) Koffman, Elliot B. and Blount, Sumner E. (1973), "Artificial Intelligence and Automatic Programming in CAI," Adv. Papers 3d Intl. Conf. on Artificial Intelligence, Stanford Univ., Stanford, CA, Aug. 1973. (AIDS) Korsvold, K. (1965), "An On-Line Algebraic Simplifica- Kotok, A. (1962), "A Chess Playing Program for the |