Note: PDF of full volume downloadable by clicking on title above (32.8 MB). Selected individual chapters available from the links below.CONTENTSINTRODUCTORY MATERIALMATHEMATICAL FOUNDATIONS1 Program scheme equivalences and second-order logic. D. C. COOPER 32 Programs and their proofs: an algebraic approach.R. M. BURSTALL and P. J. LANDIN 173 Towards the unique decomposition of graphs. C. R. SNOW andH. I. SCOINS 45THEOREM PROVING4 Advances and problems in mechanical proof procedures. D. PRAWITZ 595 Theorem-provers combining model elimination and Tesolution.D. W. LOVELAND 736 Semantic trees in automatic theorem-proving. R. KOWALSKI andP. J. HAYES 877 A machine-oriented logic incorporating the equality relation.E. E. SIBERT 1038 Paramodulation and theorem-proving in first-order theories withequality. G. ROBINSON and L. Wos 1359 Mechanizing higher-order logic. J. A. ROBINSON 151DEDUCTIVE INFORMATION RETRIEVAL10 Theorem proving and information retrieval. J. L. DARLINGTON 17311 Theorem-proving by resolution as a basis for question-answeringsystems. C. CORDELL GREEN 183MACHINE LEARNING AND HEURISTIC PROGRAMMING12 Heuristic dendral: a program for generating explanatory hypothesesin organic chemistry. B. BUCHANAN, G. SUTHERLAND andE. A. FEIGENBAUM 20913 A chess-playing program. J. J. SCOTT 25514 Analysis of the machine chess game. I. J. GOOD 26715 PROSE—Parsing Recogniser Outputting Sentences in English.D. B. VIGOR, D. URQUHART and A. WILKINSON 27116 The organization of interaction in collectives of automata. 285V. I. VARSHAVSKY COGNITIVE PROCESSES: METHODS AND MODELS17 Steps towards a model of word selection. G. R. Kiss 31518 The game of hare and hounds and the statistical study of literaryvocabulary. S. H. STOREY and M. A. MAYBREY 33719 The holophone —recent developments. D. J. WILLSHAW andH. C. LONGUET-HIGGINS 349PATTERN RECOGNITION20 Pictorial relationships — a syntactic approach. M. B. CLOWES 36121 On the construction of an efficient feature space for optical characterrecognition. A. W. M. COOMBS 38522 Linear skeletons from square cupboards. C. J. HILDITCH 403PROBLEM-ORIENTED LANGUAGES23 Absys 1: an incremental compiler for assertions; an introduction.J. M. FOSTER and E. W. ELCOCK 423PRINCIPLES FOR DESIGNING INTELLIGENT ROBOTS24 Planning and generalisation in an automaton/environment system.J. E. DORAN 43325 Freddy in toyland. R. J. POPPLESTONE 45526 Some philosophical problems from the standpoint of artificialintelligence. J. MCCARTHY and P. J. HAYES 463INDEX 505 Machine Intelligence Workshop

This paper is a survey of the current machine translation research in the US, Europe and Japan. A short history of machine translation is presented first, followed by an overview of the current research work. Representative examples of a wide range of different approaches adopted by machine translation researchers are presented. These are described in detail along with a discussion of the practicalities of scaling up these approaches for operational environments. In support of this discussion, issues in, and techniques for, evaluating machine translation systems are addressed.

Note: PDF of full volume downloadable by clicking on title above (26 MB). Selected individual chapters available from the links below. CONTENTSINTRODUCTION MATHEMATICAL FOUNDATIONS1 The morphology of prex—an essay in meta-algorithmics. J. LAS KS 32 Program schemata. M. S. PATE RSON 193 Language definition and compiler validation. J. J. FLORENTIN 334 Placing trees in lexicographic order. H. I.S COINS 43 THEOREM PROVING5 A new look at mathematics and its mechanization. B. M ELTZER 636 Some notes on resolution strategies. B. MELTZER 717 The generalized resolution principle. J. A. ROBINSON 778 Some tree-paring strategies for theorem proving. D.LUCKHAM 959 Automatic theorem proving with equality substitutions andmathematical induction. J. L. D ARLINGTON 113 MACHINE LEARNING AND HEURISTIC PROGRAMMING10 On representations of problems of reasoning about actions.S.AMAREL 13111 Descriptions. E.W.ELCOCK 17312 Kalah on Atlas. A.G.BELL 18113 Experiments with a pleasure-seeking automaton: J. E. DORAN 19514 Collective behaviour and control problems. V.I.VARSHAVSKY 217 MAN—MACHINE INTERACTION15 A comparison of heuristic, interactive, and unaided methods ofsolving a shortest-route problem. D.MICHIE, J. G. FLEMING andJ. V.OLDFIELD 24516 Interactive programming at Carnegie Tech. A.H.BOND 25717 Maintenance of large computer systems—the engineer's assistant.M.H.J.BAYLIS 269 COGNITIVE PROCESSES: METHODS AND MODELS18 The syntactic analysis of English by machine. J.P.THORNE,P.BRATLEY and H.DEWAR 28119 The adaptive memorization of sequences. H.C.LONOUETHIGGINSand A.ORTONY 311 PATTERN RECOGNITION20 An application of Graph Theory in pattern recognition.C.J.HILDITCH 325 PROBLEM-ORIENTED LANGUAGES21 Some semantics for data structures. D. PARK 35122 Writing search algorithms in functional form. R.M.BURSTALL 37323 Assertions: programs written without specifying unnecessaryorder. J.M.FOSTER 38724 The design philosophy of Pop-2. R.J.POPPLESTONE 393 INDEX 403 Machine Intelligence Workshop

E.A. Feigenbaum and J. Feldman (Eds.). Computers and Thought. McGraw-Hill, 1963. This collection includes twenty classic papers by such pioneers as A. M. Turing and Marvin Minsky who were behind the pivotal advances in artificially simulating human thought processes with computers. All Parts are available as downloadable pdf files; most individual chapters are also available separately. COMPUTING MACHINERY AND INTELLIGENCE. A. M. Turing. CHESS-PLAYING PROGRAMS AND THE PROBLEM OF COMPLEXITY. Allen Newell, J.C. Shaw and H.A. Simon. SOME STUDIES IN MACHINE LEARNING USING THE GAME OF CHECKERS. A. L. Samuel. EMPIRICAL EXPLORATIONS WITH THE LOGIC THEORY MACHINE: A CASE STUDY IN HEURISTICS. Allen Newell J.C. Shaw and H.A. Simon. REALIZATION OF A GEOMETRY-THEOREM PROVING MACHINE. H. Gelernter. EMPIRICAL EXPLORATIONS OF THE GEOMETRY-THEOREM PROVING MACHINE. H. Gelernter, J.R. Hansen, and D. W. Loveland. SUMMARY OF A HEURISTIC LINE BALANCING PROCEDURE. Fred M. Tonge. A HEURISTIC PROGRAM THAT SOLVES SYMBOLIC INTEGRATION PROBLEMS IN FRESHMAN CALCULUS. James R. Slagle. BASEBALL: AN AUTOMATIC QUESTION ANSWERER. Green, Bert F. Jr., Alice K. Wolf, Carol Chomsky, and Kenneth Laughery. INFERENTIAL MEMORY AS THE BASIS OF MACHINES WHICH UNDERSTAND NATURAL LANGUAGE. Robert K. Lindsay. PATTERN RECOGNITION BY MACHINE. Oliver G. Selfridge and Ulric Neisser. A PATTERN-RECOGNITION PROGRAM THAT GENERATES, EVALUATES, AND ADJUSTS ITS OWN OPERATORS. Leonard Uhr and Charles Vossler. GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT. Allen Newell and H.A. Simon. THE SIMULATION OF VERBAL LEARNING BEHAVIOR. Edward A. Feigenbaum. PROGRAMMING A MODEL OF HUMAN CONCEPT FORMULATION. Earl B. Hunt and Carl I. Hovland. SIMULATION OF BEHAVIOR IN THE BINARY CHOICE EXPERIMENT Julian Feldman. A MODEL OF THE TRUST INVESTMENT PROCESS. Geoffrey P. E. Clarkson. A COMPUTER MODEL OF ELEMENTARY SOCIAL BEHAVIOR. John T. Gullahorn and Jeanne E. Gullahorn. TOWARD INTELLIGENT MACHINES. Paul Armer. STEPS TOWARD ARTIFICIAL INTELLIGENCE. Marvin Minsky. A SELECTED DESCRIPTOR-INDEXED BIBLIOGRAPHY TO THE LITERATURE ON ARTIFICIAL INTELLIGENCE. Marvin Minsky.

This article is concerned with the psychology of human thinking. It setsforth a theory to explain how some humans try to solve some simpleformal problems. The research from which the theory emerged is intimatelyrelated to the field of information processing and the construction of intelligentautomata, and the theory is expressed in the form of a computerprogram. The rapid technical advances in the art of programming digitalcomputers to do sophisticated tasks have made such a theory feasible.It is often argued that a careful line must be drawn between the attemptto accomplish with machines the same tasks that humans perform, andthe attempt to simulate the processes humans actually use to accomplishthese tasks. The program discussed in the report, GPS (General ProblemSolver), maximally confuses the two approaches—with-mutual"!benefit. Lerende Automaten, Munich: Oldenberg KG

This listing is intended as an introduction to the literature on Artificial Intelligence, €”i.e., to the literature dealing with the problem of making machines behave intelligently. We have divided this area into categories and cross-indexed the references accordingly. Large bibliographies without some classification facility are next to useless. This particular field is still young, but there are already many instances in which workers have wasted much time in rediscovering (for better or for worse) schemes already reported. In the last year or two this problem has become worse, and in such a situation just about any information is better than none. This bibliography is intended to serve just that purpose-to present some information about this literature. The selection was confined mainly to publications directly concerned with construction of artificial problem-solving systems. Many peripheral areas are omitted completely or represented only by a few citations.IRE Trans. on Human Factors in Electronics, HFE-2, pages 39-55

Journal of the Association for Computing Machinery, Vol 7, pp. 102-128

This work is partly included in a project sponsored by Statens tekniska forskningsråd (Sweden). Berg, and Mr Voghera for reading the manuscript and making valuable suggestions (see also n. 11). Use the link below to share a full-text version of this article with your friends and colleagues.

This is an attempt to analyze attitudes and arguments brought forth by questions like "Can machines think?" and "Can machines exhibit intelligence?" Its purpose is to improve the climate which surrounds research in the field of machine or artificial intelligence. Its goal is not to convince those who answer the above questions negatively that they are wrong (although an attempt will be made to refute some of the negative arguments) but that they should be tolerant of research investigating these questions. The negative attitudes existent today tend to inhibit such research.Reprinted in Feigenbaum & Feldman, Computers and Thought (1963).Also in Datamation 9(3), March 1963, pp.34-38.Symposium on Bionics, Rand Technical Report 60 600, pp. 13-19

TABLE OF CONTENTS FOR the two volumes of papers and discussions of papers from the 1959 conference held at the National Physical Laboratory, sometimes known as "The Teddington Conference". Officially these two volumes are the Proceedings of the Symposium on Mechanisation of Thought Processes. Many of the classics are downloadable separately, the remainder are available from the longer downloads of the complete volumes:Vol 1 = http://aitopics.org/sites/default/files/classic/TeddingtonConference/Mechanisation of Thought Processes Vol. 1.pdfVol. 2 = http://aitopics.org/sites/default/files/classic/TeddingtonConference/Mechanisation of Thought Processes Vol. 2.pdfTeddington Conference