SRI-Al*

I <FEIGENBAUM>AI,SYLLABUSH SAT 19-JUL-75 7143AM

18-JUL-75 13 552148-PDT, 40540 I 000 000000000Mail from SU-AI rcvd at 18-JUL-75 1348-PDTDate! 18-JUL-75 12|59 PM PDTFrom! Terry Winograd (TW " SU-AI)Subject! .require "doc.hd [ai , tw) " sourcetXflleTo! feigenbaum " SUMEX-AIM, larson " SUMEX-AIM, newell " CMU-10A, nilsson« " " - mlkWcUu m MTT.AT. ui*nm»*A A PARf-MAYT" " - minkskv " MIT-AI, winograd " PARC-MAXC

.every heading (Stanford ai syllabus " 197b* , <page> )

.font 1 "basl3o",f2|f3,?ont c H basl3o".font b "basb3o".head ISyllabus for Qualifying Exam!.begin center.se! ect 3in Arti f icial Intel l lgence.skip.select 2Department of Computer ScienceStanford UniversitySpring 1975.end,f 1 1 1 Undent s*o

The syllabus this year is organized to present a picture of therange of knowledge expected of Ph.D. candidates In ArtificialIntelligence* rather than sped f y l ng a fixed list of readings.There are a number of different dimensions along which we coulddivide up the material. Rather than choosing one* we have includedthem all* with a good deal of overlap. Hopefully the set of referencesincluded with each item will make 1t possible for each studentto select a reasonable number of readings whichwill fill his^or her knowledge gaps. The reading list is intendedas a source of details on individual references* not as a necessaryset of things to read. It includes a rough indication of what sortOf understanding is most important for each reference "" whether thereis a genera! perspective* one or more specific concepts* and/or a bodyof detail with which students are expected to be fluent. Theseindications are of course based on the prejudices and peculiaritiesof the committee making up the syllabus* and should not be takenas representing the views of anyone else (including the membersof individual exam committees), Use your Judgement,

Please send any comments or suggestions on the syllabus toTerry winograd at the Stanford AI Lab, (TW^SAIL if you're on-line).We are hoping to get lots of feedback* and begin building towarda syllabus which really describes what there is to know [and whatis important to know] about Al* to be built on year after year,.head (Mechanics of the Examination!.f 1 1 1 Hndent 5,0The examination will be an mdi ndi vi dual I y-seheduled oral, before acommittee consisting of three members, chosen from the faculty,adjunct faculty* senior research staff* and possibly appropriatesenior researchers from AI facilities In the area like SRI and XeroxPARC, Each committee will include at least one faculty member and atleast one Person in a potential area of specialization of thecandidate. The candidate can request a particular person in his or

<FEIGENPAUM>AI,SYLLABUBf I SAT 19-JUL-75 7ia3AMJ

then

examsect i on

Wav of

her area* but the Qua! committee has final choice of examiningcommi t tees t

At leastthree weeks before a student's examination, he or she will be given ciCi) a problem to be worked on an open-book basisj or (ii)a research paper on which he or she will write a critique.The resul ts are to behanded in to the aval committee (Ooug Lenat or Terry Winograd)no later than one week before the exam, The members of the individualcommittee will be given copies of the solution or paper, and the firstof the exam (up to an hour) will center around issues raised by thework done. The rest of the exam will be on anyquestions the examiners consider appropriate,

The Purpose of the exam is to demonstrate that the student has donesufficient reading and thinking to fit his or her individual researchinto a Perspective of other work in Al, This includes detailedknowledge of some other existing work* both in the sub-area in whichthe student intends to do research, and in other sub-areas. Thecommittee should be satisfied that the student already has asufficient grasp of both the general issues and of a reasonableamount of technical detail, The exam is not intended as a device todecide who will and will not be able to continue in the program, butrather a way of focussing effort on a comprehensive study of Al, andoroviding students with specific diagnostics for gaps in theirknowledge or understanding, The possible outcomes of the exam arei.begin i ndent 5, 10, 5Pass uncondi t ional 1 y J The student has a satisfactory knowledge of allareas

Pass conditionally! The student has some lacks which can be made upby directed work, such as the completion of specific coursefs) orspecific research oroject(s), The committee will set both the scopeof the work and a time period in which it must be completed in orderfor the examination to count as passed,

Continuation of the_exami nat i oni The student has a lack which demandsa moderate amount of further study in one or more areas, and a secondoral examination (with the same committee) will be scheduled withinthe next quarter,

Deferi The student has significant gaps in knowledge which cannot bemade up by limited correctives, Candidate is required to take theexam another time it is offered, under whatever system is in effectthen,,end,head IDimensionslThere are, a number of different perspectives we might take onthe work in AI» each emphasizing different concepts and differentmaterial, We^have chosen the following ones as an outline forthe readi ng list!,subsubhead IBasie Approaches!,subsubhead (Problem domains!.subsubhead ITeehnieal Toplsl.subsubhead (Relation to other areas of studyl,subsubhead (Practical applications and implications!

<FEI6ENBAUM>AI , SYLLABUS I i SAT 19-JUL-75 7J43AMJ

,subsubhead (Superstructure (history and polities of the field)!

The pointers given for each topic art not intended to represent theonly or most aut horatat i ve sources, They serve as a good initialgood initialplace to get an understanding of the topic# and other referencesare mentioned with them in the reference list for further reading,

.head (Basic Approaches!

.nofill[Minsky STEPS] (Feigenbaum IFIP]

usubsubhead |Weak Methods!tNi lsson OVERVIEW]

(Newell ILL)Search Spaces (Nilsson Al)

And-or graphsGame treesHeuristic Search

Problem Soaee [Newell & Simon HPS)GPS [Newell, Shaw, & Simon, GPS]

General Problem-Solving Techniques[Wickelgren SOLVING) [Polya <all>3 (Newell in SCHANK&COLBYI

,subsubhead (Formal Logic!

Actions and the frame problem (McCarthy & Mayes PHILOSOPHICAL)Theorem Proving [Green TP]

(Nilsson Al)Resol ut i on.subsubhead (Programming!

[Minsky & Paoert PROGRESS], [Winston MIT74)[Hewitt APPRENTICE)

Knowledge-based systemsProcedural Embedding

,subsubhead (Representation!

[Amare! ACTIONS)Basic issuesPredicate CalculusPredicate Calculus [McCarthy & Hayes PHILOSOPHICAL)Networks [Quillian SEMANTIC MEMORY]Conceptual Dependency (Schank in S&C)Frames [Minsky FRAMES]

,subsubhead (Cybernetics - Adaptive Systems!,head IProblem domains}.subsubhead IGame Playing!

General (Nilsson. Al] [Slagle AllCheckers (Samuel in C&T]Chess (Greenblatt FJCC] (Berliner 3UCAI], subsubhead (Common-sense Reasoning!

Heuristics [McCarthy ADVICE-TAKER]Planning

r

(F \ kes, Hart , N1 1 sson STRIPSHSacerdot i ABSTPIPSI.subsubhead (Mathematical theorem proving!

[Bledsoe MAN-MACHINE) [Guard SAM], subsubhead INatura! Language!

Early work[Simmons SURVEY 1965) (Simmons SURVEY 1970) (Minsky SIP (browse)](WeUenbaum ELIZA]

<FEIGENBAUM>AI,SYLLABUS»I SAT 19-JUL-75 7|43AM}

Syntax[Woods ATN) [Winograd in S&C]

Semantic theories[Schank in S&CJ [Schank et, al, MARGIE] tSimmmoms in S&C)[Winograd in S&C) [Winograd FIVE)

Stories and Bel ft?(Charniak in MIT7U) [MeDermott in MIT7U] [Abelson and Schank aiJCAII

Transl at i on(Wi Iks in S&C! ,

Speech underst andi no(Reddy in lEEE) (Woods in lEEE) (Walker in lEEE) [Newel! SPEECH]

.subsubhead IVisionl

Pattern Recognition (Selfridge and Neisser in C&T] [Hunt ADPerceptrons (Hunt AHSignal ProcessingScene Analysis [Agin and Binford CURVED] [Yakimovsky & Feldman AIJ]

(Waltz in MIT74).subsubhead iPhysical manipulation!

HandsMobi l ity

[Finkel et, al , AL) [Stanford Robotics films]

.subsubhead (Automatic Programming!

[Buchanan and Luckham AUTOMATING) [Sussman and Goldstein in MlT7a][Waldinger&Mannal (Floyd INTERACTIVE] (Green & * <some>)

.next page"subsubhead lExpert Systems!

Mathematics [Martin and Fateman MACSYMA]Chemistry [Feigenbaum et, al, DENDRAL]Medicine (Short! i f fe MYCIN], subsubhead (Music and Art!

(Gips AESTHETICS) tMoorer MUSIC).subsubhead iLearning and Inductive Inference!

[Sussman in MIT74] [Goldstein in MIT74] (Buchanan et.al.THEORY-FORMATION] [Winston in M1T741 [Fikes et , aI .GENERALIZED)

.subsubhead (Psychological Models!

Information Processing Psychology[Newell and Simon MPS (Sections 1 and 5 especially)]

Verba! Behavior[Feigenbaum EPAM] (Anderson & Bower HAM (chapters 4 and 7))

Paranoia [Colby in Schank & Colby)Intelligence Tests [Evans ANALOGY)

.head (Technical ToolsJ

.subsubhead (Formal Logic!

Formal Logic [Manna MTC)Resolution [Nilsson All or [Hunt Al]

.subsubhead lAutomata Theory!

Perceptrons [Hunt All extra detail in [Minsky & Paoert PERCEPTRONS]Formal Languages and Machines (Minsky COMPUTATION) [Manna MTC)

.subsubhead (Programming LanguagesJ

<FEIGENBAUM>AI,SYLLABUS>I SAT 19-JUL-75 7843AM!

List Processing i« LISPString processing -" SNOBOLAssociative mechanisms -- LEAP/SAILActive data structures -- SIMULA/SMALLTALK/ACTORSPattern Matching (Bobrow & Raphael!Data Structures (Knuth Vol, l]PLANNER* CONNIVER* QA4, etc, [McDermott & Sussman in MIT74]Production Systems (Newel! PRODUCTION]

.begin finThe candidate is expected to be familiar enough with some Al language (e.g,LISP or SAIL) to demonstrate the ability to write simple orograms, He or sheshould also know enough about the features of the more specialized languages(CONNIVER, QA4, the LEAP and mul t i p! e. process features in SAIL) to discussthe kinds of problemsfor which they are useful* and the limitations theyforce the programmer into,

vlt is not necessary

to know syntactic details of these features..end.subsubhead ISearchl

(Nilsson Al)Combinatorial issuesMinimax *- alpha-betaHeuristic search strategiHill ClimbingMeans-end AnalysisPruning mm plausible move generation -- horizon effects [Berliner]Use of models (Gelernter GEOMETRY]

.head ißelation to other areas of study!.begin fillThis section is an unfinished part of what the syllabus should include,We would be grateful for suggestions for specific references. Forthe purposes of the current exam, this list should be taken as a setof issues about which students should have spent some time thinking,For each area* consider (i) lessons from that area which influence Al researchi\\) actual impact of Al on that field today* (iii) possible futureeffects of Al on thedevelopment of that field,.end

.subsubhead (Mathematics!

LogicComputational Complexity

.subsubhead IPsychologyl

Information processing psychologyStructural epistemology (Piaget)

"subsubhead (Linguistics)

The nature of ruleMethodol ogy

.subsubhead IBiologvl

Neurosci eneesEthology

.subsubhead (Philosophy!

<FEIGENBAUM>AI, SYLLABUS, I SAT 19-JUL-75 7|43AMT

Mind-body problemLimitations on machines and minds

.subsubhead (Computer Seiencel

Programming languagesControl issuesHardwareData structures

.head (Implications!

(SIGCAS publications).subsubhead (Philosophical!

(Turing TEST) (Dreyfus CAN'T] (Papert DREYFUS][McCarthy and Hayes] (The Rock Test* others in Anderson MINDS)

.subsubhead |Pol i t ical I(Weiner HUMAN]

.subsubhead (Practical IAutomationOther business applicationsApplications in the home

.subsubhead (Long-range!

Science fiction and popular misconceptions(Firschein & Coles IJCAI3 survey)

.head [Superstructure (history and politics of the field)!

.begin fillA critical part of being able to do and evaluate research in a fieldis having some perspective on what things have been done and why --in particular* what _ lessons have been learned and howcan theybe applied to keeo from repeating mistakes, In addition* studentsneed to know where and how things are published in the field ifthey hope to keep up with current work.Partly as a guide* partly as a reminderis at least as necessary for a completethe ideas of the field as ispurely technical background,.end.subsubhead |History(

Cybernet i csOverootimism (e.g. ex'eatadimns

This section is includedthat this kind of understandingunderstanding of

for self organizing systems* translation)(Feigenbaum a nd Feldman C&T)(Simmons' Language Surveys, 1965, 19701(Minsky STEPS] (Minsky m,m,&M]Perceptrons and neural netsKnow magnitude of gains in speed and memory size over this time span,

.subsubhead (Main centers and figures!

.subsubhead iFundingl

.subsubhead (Publications and Conferences!

Journal of AlSIGARTSIGCAS

<FEIGENBAUM>AI,SYLLABUS|I SAT 19-JUL-75 7J43AMJ

Machi ne Intel 1 i genceIJCAI proceedingsCACM (computer science* some Al)JACM (computer science* some Al)Cognitive Psychology (some Al)

American Journal of Computational Linguistics (some Al)Special interest conferences! cybernetics, natural language, robotics

,head (Readings!.subhead |Expl anat i oni J.fill jindent 5,0The following list is NOT. a list of reouired readings, butguide to interesting, avai lab1 abl c mater i al s in each subfield.Some of the papers are not yet published but will be madeavai lab1 abl c,

A simple annotation system has been used to give some feeling for thelevel and importance (measured i di osyncrat i cal 1 y by the syllabuspreparers) of each paper, The level is indicated asi"begin nof i 1 1 i indent 8

ESS! An essay giving general perspective and discussion of basic issuesSURV! A survey of research work in some areaSUM! A summary at a non-detailed level of a specific piece of researchDR! A detailed research reportTEXT! A textbook.endThe importance is based on whether the paper is important forunderstanding a general perspective (P)» whether it has one ormore specific important ideas (I), or whether it gives a set ofdetails over which students are expected to have fluent command (D),We repeat! these are opinions, hastily arrived atlIf 9 reference is followed by neither an "I"* a"P"*or a "D"» then thatindicates it is not basic for an understanding of Al,An Al grad student should nevertheless have looked at %esome%* of this type ofmaterial* in at least a few subfields of Al,

In addition, we have marked with a "#■ a subset of the papers, which canbe thought of as an initial reading list -* they represent many of themost important works, and provide a basic background,

Many of the references below point to more specialized sources for thosehighly interested! for completeness, all these specialized references are listedagain, separately* below, So don't be put off by the apparent amount ofreading involved! hopefully each student will have only a few gaos*

and it will be possible to glance over the outline*choosing to read in those areas where the referencespointed to are not familiar,.head (References!.fill Hndent o*3Abelson, Robert, and Roger Schank,Scripts* Plans* and Knowledge* to appear in %e4IJCAI,X*This* like many obscure references below, will be made available* onreserve* at the Al Lab,(SUM* )

<FEIGENBAUM>AI, SYLLABUS!! SAT 19-JUL-75 7!43AM>

1974

"Agin, G. and^Binford, T, (1973) Computer Description of CurvedObjects, XeThird Internatonal Joint Conference on ArtificialIntelligence, Advanced PaoersX*,pD 629-640,(SUM*llthe basic representation)

Allen, J, & D, Luckham, « AN INTERACTIVE THEOREM PROVING PROGRAM"XeMachine Intelligence 5%*, Edinburgh University Press* 1970, pp32i-336,(SUM* SURV)

"Amarel* Saul (1968) On Representations of Problems of Reasoning AboutActions* in XeMaehine Intelligence 3%*, pp, 131-171 (eds Meltzer andMichie)# New York! Amer i canEl sevi er Publishing Company,(DR*P* lief fects of change of reor, on problem solubility* )

"Anderson* J, R,» and Bower* G, H,* XeHuman Associative MemqryX** v',H, Winston and Sons, Washington, D.C., 1973, Especially Chapters 4, 5* & 7,(SURV & DR*P)

Anderson* (ed) * XeMinds and MaehinesX** Contemporary Perspectives inPhilosophy Series* Prentice-Hall* Inc* N,J t , 1964,(Collection of essays, each of which is rated at least! (ESS, ))

Arbib* Michael A,, XeThe Metaphorical Brain! An Introduction toCybernetics as Artificial Intelligence and Brain TheoryX*,wi ley-Interscience* New York* New York* 1972* xii ■♦" 243 pages*(SURV, )

Banerji* R.B.* and Mesarovie, M.D.* editors, XeTheoret i calApproaches to Non-numerical Problem SolvingX*, Spr i nger-Ver 1 ag» NewYork, New York* 1970, (TEXT* ),

"Berliner, Hans, Some Necessary Conditions for a Master Chess Program,Xe3rd IJCAIX*, 1973, pp. 77-85,(SUM, I)

"Bledsoe* W,W,» and Bruell (1974) A Man-Machine Theorem-ProvingSystem* XeJournal of AlX** 5* 1974, pp 51-72,(SUM,P)

Bobrow* Dan* and Collins* Allan, editors, Xeßepresentati on andUnderstandingX** Academic Press* Ine,» New York* New York* 1975(a collection of papers mentioned individually* each SUM, I)

"Bobrow and Raphael, (1973) New Programming Languages for Al Research,XEROX Report CSL-73-2, August 20, 1973, Also found in Computing Surveys, Sept,(SURV, I)

"Buchanan, 8,, Feigenbaum, and Sridharan (1972) Heuristic Theory Formation,XeMachine Intelligence 7X*» pp»267-280 (the appendix may be omitted),(SUM* Hchoosing proper domain is important)

Buchanan* Jack (1974) A Study in Automatic Programming* SAIL MemoAIM-245* STAN-CS-74-458* M a y» 1974,(DR,)

"Buchanan, J, and David C. Luckham, "On Automating the Construction of ProgramsAIM-236, CS-433, AD78451 3/4WC, 65 pages, May 1974, Highly technical! Just skim,

<FEIGENBAUM>AI,SYLLABUS!I SAT 19-JUL-75 7143AMJ

(DR,P)

Chandrasekharan and Reeker (1974) All A Case for Agnosticism, in XeIEEETransactions on Systems, Man, and Cybemeti esX* j January, 1974, pp, BB-94,(ESS,P)

Chang, Chin-Liang* and Lee, Richard Char-Tung* XeSymbolic Logic andMechanical Theorem ProvingX** Academic Press* Inc.* New York* NewYork* 1973* 346 pages* $19,00, More detail than is reouired,(TEXT)

Chase, w,G,, edi tor, tVtP+W#sual Information Processi ngX*, AcademicPress, Inc., New York, New York, 1973,(Collection, each of which is at least (SUM, )j some are singled out elsewhere,)

"Colby* Kenneth Mark*

_Simulationsi mvl at i ons of belief systems* in Schank and Colby (eds,), Al

a recent book* XeArtifieia! ParanoiaX*,1975,The article in Schank and Colbyi s sufficient.(SUM,DR* lilt's easier to simulate a rigid personality than a norma! one)

Coles* Steve, and Fikes, Rich, editors, XeSIGART News! et terX*,Special Interest Group on Artificial Intelligence (SIGART),Association for Computing Machinery, New York, New York* bimonthly(since 1967)* 50 Pao.es (approximate)* $10,00 per year (free tomembers of SIGART),(SURV/SUM, )

"Darlington and Burstall (1973) A System Which Automatically ImprovesPrograms* %e3rd UCAIX** pp, 479-485,(SUM* liencbding knowledge into schemata rewriting rules)

Dijkstra* Dahl, and Hoare, XeStructured Programmi ngX*(DR, I)

Dreyfus, Hubert, Alchemy and Artificial Intelligence, copies will be available,(ESS, P)

"Dreyfus, Hubert, XeWhat Computers Can't(ESS,P)

DoX*, Harper and Row, 1972,

Duda, R,, and Hart, P,, XePattern Classification and SceneAnalvsisX*, John Wiley and Sons, New York* New York* 1973,Much more detail than is required! emphasis is not Al,(DR*TEXT)

Ernst* George W,, and Newe!!, Allen, XeGPSi A Case Study inGenerality and Problem SolvingX*, Academic Press, New York, NewYork, 1969* m, 4 297 pages* $16,50 ($13,20 to members of theAssociation for Computing Machinery), Not central* but many good ideas are inside,(DR* )

"Evans! ANALOGY* found in [Minsky SIP), For related work* see (Ming ANALOGY],(SUM* lipower of using even a crude version of a single simple heuristic)

"Falk, G, (1972) Interpretation of Imperfect Line Data

SAT 19-JUL-75 7143AM<FEIGENBAUM>AI, SYLLABUS 1 1»

Three-dimensional Scene! in The XeArtificial Intelligence JoumalX*(Summer, 1972) Vol, 3* op, 101-144,(SUM* Hgood when nature falls into a few tens of categories* so task is hard butdoabl e. )

"Feigenbaum, E.i EPAMi found in XeComputers and ThoughtX* (Fei genebaum, editor)(SUM, P general idea of psychological modelling)

"Feigenbaum, E, et al (1971) [DENDRAL) On Generality and Problem Solving! A CaseStudy Using The DENDRAL Program, (eds Meltzer and Michie) XeMachineIntelligence 6X*, po 165-190,(SUM, l i A useful application! Choose domain carefully)

(C&T) Feigenbaum, Edward A,, and Feldman, Julian, editors, XeComputers andThoughtX*, McGraw-Hill Book Comoany, New York* New York, 1963, xiv +535 Pages, $8,75, Old but worth reading,(Collection, each of which is at least (SUM, ), Some singled out elsewhere,)

Feldman* Pingle, Binford, Falk, Kay, Paul, Sproull, Tenenbaum, (1971)The Use of Vision and Manipulation to Solve the Instant InsanityPuztle! in Xe2nd IJCAIX*,(SUM, }

"Fikes* R. E, et a! (1972) Learning and Executing Generalized RobotPlans, XeArtificial Intell i genceX** Vol, 3 (Winter 1972),(SUM* liTriangle Tables! handling of Frame orobl em,p! ans, Di Triangle tables)

Findler* N,V,, and Meltzer* B,» editors* XeArtificial Intelligenceand Heuristic Programmi ngX*, Edinburgh University Press, Edinburgh,Scotland, 1971, ? + ? pages, $15,00,(SUM, a collection of papers)

Finkel, R,» Russel Taylor, Robert Bolles, Richard Paul, Jerome Feldman,"AL« A Programming System for Automation", AIM-243, CS-456, 130 pages, November 1974(DR, )

"Firschein, 0,, and Coles, S, (1973) Forecasting and Assessing TheImpact of Artificial Intelligence on Society, Xe3rd IJCAIX*! 105-120(SUM, Questionaire results! Look this over, at least.)

"Floyd, R, W, (1971) Toward Interactive Design of Correct Programs,XeIFIP 71X*, (cd,* C.V, Freeman)* Volume 1, pp. 7-10,(ESS! An extended example. Brief* but contains an idea Ii Auto.ogmming via dialogue)

Fogel f Lawrence J,, Owens, Alvin J,, and Walsh* Michael J.»XeArtificial Intelligence through a Simulation of EvolutionX** JohnWiley and Sons* New York* New York* 1966, Just glance over this andnotice what its significance is,(DR# P!title of the book)

"Gelernter! GEOMETRY, _ Found 1« [C&T),(SUM* liuse of analogic models)

Gips* J, Shape grammars and their uses* Al memo 231* last third is onaesthetics. Will soon be published by Birkhauser Verlag* Basle, Switzerland,(DR, liPicture grammar, aesthetics related to simplicity)

<FEIGENBAUM>AI, SYLLABUS;! SAT 19-JUL-75 7143AM!

"Goldman, Neil* Sentence Paraphrasing fromFebruary 1975* op, 96-107,

Conceptual Base* XeCACMX** 18|2

(SUM* 1 1 integrat ion of decision tree control with conceptual dependency),

Goldstein* Ira* Understanding Simple Picturein [MIT 1974] , programs* summary

(SUM, Ii use of models in debugging)

"Guard, J.R., et al. (1969) Semi -Automated Mathematics* XeJACMX* 16*January* 1969* pp, 49-62,(SUM* DIA new result in Math has been established by a computer program! SAM»s LEMMA)

"Green* C, C, (1969) [TP] The Application of Theorem Proving to QA Systems*Stanford Technical Report CS 138* SAIL Memo AI-96,(DR, liuse of Resolution to write programs)

Green, C,C,, and Barstow, D,, A Hypothetical Dialogue Exhibiting a KnowledgeBase for a Program-Understanding System, Al Memo 258, January, 1975,(ESS! An extended example, )

"Green, Waldinger, Barstow, Elsehlager* Lenat, McCune, Shaw, and Steinberg,Progress Report on Program-Understanding Systems, Memo AIM*24O,CS Report STAN-CS-74-444, Art I f i c i al Intelligence Laboratory,Stanford University, August* 1974, Nontechnical report* Just look it over,(SUM, II various approaches to program specification)

"Greenblatt* R.8., D, Eastlake and S, Crocker, The Greenblatt Chess ProgramXeProeeedi ngsof the 1967 Joint computer conf ereneeX*, 30i80!-810, 1967,(SUM, liuse of a variety of game playing techniques)

Hart, Peter E,, Progress of a Computer Based Consultant, Al Group TechnicalNote 99, SRI Project 3805, January, 1975, This is a general* preliminaryreport of a proposed system which integrates ideas from several Al domains,(SUM, )

"Hewitt* Car] and Brian Smith* Towards a Programming Apprentice, in(copies avai Table) ,

(SUM, liActors)

"Hunt, Earl 8,, XeArtificial Intel l i genceX*, Academic Press, Ine,,New York, New York, 1975, ? + 478 pages, $29,00,(TEXT, Digood coverage of pattern recog, and perceptrons)

Jackson, Philip C,, Jr., Xelnt roduct i on to ArtificialIntel l igenceX*, Petrocelli Books, New York, New York, 1974, xyiii t453 Pages, $17,50, Elementary; if you feel lost in some subfield, consult this,(TEXT, )

"Kling, Robert E,» A Paradigm for Reasoning by Analogy*XeArtificial Intelligence 2X*, 1971, pp, 147-178,(SUM, lisimilar to Evans' idea, but analyzed further,)

Lenat, Doug, BEINGS,,, current paoer to be made available,(DR, Ilbeings)

"Victor Lesser, Richard Fennel!, Lee Erman and D, Raj Reddy, Organizationof the Hearsay II Speech Understanding System, XeIEEE Symposium on Speech

«FEIGENBAUM>A I .SYLLABUS il SAT 19-JUL-75 7143AM»

Recogni t ionX*, Computer Science Dept,, Carnegie Mellon Univ,, 1974,(SUM, limodular system organiztion)

"Lighthill* Sir J,, and Sutherland, Needham, Longuet-Hi ggi ns, andMichie (1973) All A Paper Symposium! by the British Science ResearchCouncil, April, 1973, A pro/con Al debate,Try to see the McCarthy, M< e hie vs, Lighthill debate on videotaoe,(ESS, P, a general survey giving Lighthill's view on AJ, See McCarthy's response)

Lindsay, Peter H,, and Norman, Donald A,, XeHuman InformationProcessing! An Introduction to Psychol ogyX*, Academic Press, Inc.,New York, New York, 1972, xxviii ♦ 737 Pages, $?,??,(TEXT, P a comprehensive elementary introduction to cognitive psychology fromview congenial to Al),

Low, James R,, Automatic Coding! Choice of Data Structures,SAIL Al Memo AIM-242, August, 1974, Long but some new ideas inside,(DR, )

Manna, Zohar, XeMat hemat i cal Theory of Comput at i onX*,[Newell AD suffices,(TEXT, I/D! Read some book or article to gain familiarity with Prop and Pred Calc)

"Martin and Fateman (1971) The MACSYMA System, in (S, Petrick, ed,)Xe2nd Symposium on Symbolic and Algebraic Manipul at i onX*. NYI ACM SIGSAM,pp 59-75,(SUM,Ii application of Al techniques to a specific domain area)

"McCarthy, J,, [ADVICE-TAKER] "Programs With Common Sense",Stanford Al Memo AIM-7, , AD785044, 7 pages, September 1963,For details, also look at also the following memo!(ESS, liwhat we need i5,,,)

McCarthy, J,, "Situations, Actions, and Causa! Laws", Stanford Al Memo 2, July 1963,(ESS/DR! IlYou can formalize these notions)

"McCarthy, j, and Hayes, P, (1969) Some Philosophical Problems fromThe Standpoint of Al, XeMaehine Intelligence 4X* (eds Meltzer andMichie) pp, 463-502, Edinburgh University Press,(ESS/DRI I/D s More of the same as the last reading, Further developed.)

"McCarthy, John, Review of Lighthill debate, Al Journal, wil] be madeavai lab1 abl c in CS ! ibrary.

XeMechani zat ion of Thought ProcessesX*, Her Majesty's StationeryOffice, 1958, Contains early McCarthy papers,

Meltzer, Bernard, and Miehie, Donald, editors, XeMaehineIntel ! i genceX*, volumes 1-6, American ElsevierPublishing Company, New York, New York, volumes 7», HalsteadPress, New York, New York, annually (since 1967), x + 525 pages(approximate), $30,00, Needless to say, don't study every article,(Collection of articles, each at least (SUM, )),

Meltzer, Bernard, and Raphael, Bertram, editors* XeArtificialIntelligence! An International JournalX** North-Holland Publishing

<FEIGENBAUM>AI,SYLLABUS|I SAT 19-JUL-75 7143AM1

Sons ,

Company, Amsterdam, The Netherlands, quarterly (since 1970), x * 75Pages (approximate), Dfl, 93 per year',(Collection of articles, each at least (SUM, )),

Michie, Donald* XeOn Machine Intel l i geneeX** John wiley and Sons*New York* New York* 1974, xii ♦ 199 pages*(SURV* P)

Minsky* Marvin* XeComout at i on! Finite and Infinite MachinesX* PrenticeHall, 1968,Not in Al but you should know at least this much anyway.(TEXT* I/Dl Know at least this much about the theory of computation)

"Minsky* M, FRAMES! found in Winston* cd,* [MIT74](SUM, liFrames)

"Minsky, M, [MMM] Minds, Models, and Machines; found in tMinsky SIP](ESS, Pi makes explicit many of the underlying notions of Al models)

Minsky, Marvin, editor, [SIP] XeSemantic Information Processi ngX*, TheMIT Press, Cambridge, Massachusetts, 1968, viii + 440 pages, $15,00,(Collection of MIT natl, lang, dissertations, all at least (SUM/DR, ))

Minsky, Steps to Al, found in [Minsky, SIP](SURV, worth reading to get a flavor of the ideas at that time)

"Minsky, M, and Papert, 5,(1972) tPROGRESS] Artificial Intelligence ProgressReport, MIT Project MAC, Al Memo 252,(SURV, P| the only coherent recent presentation of the "MIT Al philosophy" )

Minsky and Papert XePerceptronsX*, MIT 1969,A sufficient expertise can be gainedfrom the appropriate section of [Hunt Al] ,In looking at this book, try to read throughpage 25| then look through the rest! especially note theconcluding remarks, pp. 227-246,(DR, liapPlying rigourous mathematics to what Al-systems of different typescan theoretically achieve)

"Moore* Jim and Allen Newell* How can. MERLIN understand?,in Gregg (ed,) XeKnowledge and Cognition, X* LawrenceErlbaum Associates, 1973,(SUM, HBeta structures! criteria for understanding systems)

Moorer, James A,, "Music and Computer Composition", XeComm, ACMX*,January 1972,(SURV)

Newborn, M,* XeComputer ChessX** Academic Press* Inc.* New York*New York* 1975* 200 pages, $15,00, If you're interested,(SURV)

"Newell, A, (1969) [ILL) Heuristic Programming! I! 1 -Structured Problems, in(cd. Aronofskv, A,) XeProgress in Operations Research lIIX*, John Wiley and(ESS, P)

Newell, A, (1965) Limitations of The Current Stock of Ideas about

<FEIGENBAUM>AI,SYLLABUS;i SAT 19-JUL-75 7143AM»

ThoughtX*

Probl emiSol vi ng, XeProeeedi ngs of a Conference on ElectronicInformation HandlingX*, pp, 195-208, (eds Kent and Taulbee) New Yorki Spartan,(ESS, interesting reading)

"Newell (1973) Production Systems! Models of Control Structures, May,1973 CMU Report, also published in (W,G, Chase, ed,) XeVisualInformation Processi ngX*, NY! Academic Press, Chapter 10, pp, 463-526,(DR/SUM, Iltitle of paper!)

Newell, A, (1970) Remarks on The Relationship Between Al andCognitive Psychology, in (BanerJl and Mesarovic* eds,) XeTheoret l ca!Approaches to Non-Numerical Problem SolvlngX** pp 363-400, New York!Spri nger-Verlag1 ag Pub,(ESS* P)

Newell* A,* Barnett* Jeffrey* Forgie, James W,, Green, Cordell*Klatt, Dennis, Licklider, J,C,R,» Munson* John, Reddy, D, Raj* andWoods, William A,, [SPEECH] XeSpeech Understanding Systems! Final Report of aStudy GrouoX** American Elsevier Publishing Company* New York, NewYork* 1973* xiv t 137 pages* $6,75, Read espec i al l vi Chaps, I*4; Appendix A2,(SURV* IlEvaluating research goals and guiding research toward them)

"Newell, Shaw, and Simon, GPSi for this, see their article in XeComputers and(Feigenbaum end Feldman, eds), Rating 1s (SUM, Ijinfo proc, psych approach)Also see the relevant chapter in [Newel! and Simon, HPS,]For many, detailed, specialized applications and analyses, see [Ernst GPS),

"Newell, A», and Simon, Herbert A,, [HPS] XeHuman Problem SolvlngX*,Prentice-Hall, Englewood Cliffs, New Jersey, 1972, xvl + 920 pages,Read the first and last chapters, look over Chaos, 3,4,8,(DR/ESS/SUM, Diknow what LT was, what a PBG is, production systems)

"Nilsson, N, J, (1974) [OVERVIEW] Artificial Intelligence,SRI Technical Note 89 (March, 1974),and also IFIP Congress 74 (Sweden, August, 1974),(SURV)

"Nilsson, Nils J,, [Al] XeProblem-sol ving Methods "in ArtificialIntel 1 1 geneeX*, McGraw-Hill Book Company, New York, New York, 1971(TEXT, but I/DlGood presentation of resolution, searching, tBtC, etc.)

Norman, Denal d,m Rumel hart , D,» and the LNR Research Group,

XeE*olorat ions in Cognition, X* Freeman, 1975,(SUM, Pi a collection of Daoers done from Norman's Psychol ogy/AI viewpoint)

Papert, Seymour, DREYFUS! reply, Unpublished Al memo! will be made available,(ESS,)

Polya* G, Three books. are listed here; you should beacquainted with the kinds of principles Polya tries to impress, hisstudies of heuristics. It is not necessary to study the detailedcontents of these books.

XeHow to. Solve It,X* Doubleday Anchor Books, 1945,Xelnduction and Analogy 1 n Mat hemat l cs,X* Prineeton U, Press, 1954,XePatterns of Plausible InferenceX*, Princeton U. Press, 1968,

(DR, liheuristics and how to use them)

<FEIGENBAUM>AI,SYLLABUS;I SAT 19-JUL-75 7143AM!

Quillian* M, Ross* Semantic Memory! in [Minsky SIP], Mentioned In many later NaturalLanguage works.(DR*l! network flow model for conceptual linking)

Raphael, Bertram, XeThe Challenge of Smarter ComputersX*, to bepublished. Draft available,(ESS, )

(lEEE) Reddy, D, Raj, editor, XeSoeech Recognition! Invi ted PapersPresented at the 1974 lEEE Symposium*** Academic Press* Inc.* NewYork, New York, 1975,(Collection of recent articles, all at least (SUM, ))

Rieger, Chuck,Conceptual Memory! A Theory and Computer Program for Processing theMeaning Content of Natural Language Utterances,Stanford CS dissertation, 1974 (printed by Fondazione Dalle Molle),Also available as Stanford A1M«233, CS-419,(DR, Ii memory model based on conceptual dependency -- forward imferencing)

Rustin, R,, editor, XeNatural Language Processi ngX*, AlgorithmiesPress, New York, New York, 1973,(Collection of articles, all at least (SUM, ))

"Sacerdoti, ABSTRIPS article, Xe3rd IJCAIX*, On current Planning draft,(SUM, liplanning is Just searching a sparser, more abstract space)

"tS&C) Schank, P, and Colby, X, XeComputer Models of Thought andLanguage,X* Freeman, 1973(Collection! Note especially chapters 1,4,5,6)

"Schank, Roger, Neil Goldman, Charles Rieger, and Chris Riesbeck,MARGIE! Memory, Analysis, Response Generation, and Inference on English,Xe3IJCAIX*, 1973, pp, 255-261,(SUM, l! conceptual dependency for system integration)

XeSecond International Joint Conference on Art I f i ei a!

t

lntel ! l geneeiAdvance Papers of the Conf erenceX*, OP 65449, University Microfilms,Ann Arbor, Michigan, 1971, xiv ♦ 658 pages, $35,70 (paperback),$37.95 (hardback), $11,90 (microfilm).(Col lect ion)

"Shortliffe, Davis, Axline, Buchanan, Green, and Cohen,Computer-based Consultations in Clinical Therapeutics!Explanation and Rule Acquisition Capabilities of the MYCINSystem, preprint for article in Volume 8 of the XeJournal forComputers in Biomedical ResearchX*, June, 1975.(SUM, liMedical application of production systems; communication with experts)

Simmons, R, (1965) Answering English Questions by a Computer! ASurvey, XeCACM%* 8, 1; January* 1965* pp, 53-70,(SURV* gives reasonable picture of state of art at that time)

Simmons* R, (1970) Natural Language QA Systems, XeCACMX* 13* 1; Jan,*1970* pp. 15-30,(SURV, gives reasonable picture of state of art at that time)

<FEIGENBAUM>AI,SYLLABUS;I SAT 19-JUL-75 7143AM1

"Simon* H (1973) Lessons from Perception for Chess-Playing Programs(and vice versa)* CMU Computer Science Research Review 1972-1973* pp, 35-40,(ESS I)

Simon, Herbert A,, and Siklossy, Laurent, editors* Xeßeoresentat i onand Meaning! Experiments wi th , Inf ormat 1 on Processing SystemsX**Prentice-Hall* Englewood Cliffs* New Jersey* 1972, xx ♦ 440 pages,(collection of CMU dissertations each (SUM or DR))

Slagle, J, R, (1971) XeArt i fi c l al Intel H gencei The HeuristicProgramming ApproachX*, New Yorki McGraw Hill, Elementary,(TEXT, )

"Sloman, Aaron (1971) Interactions Between Philosophy and ArtificialIntelligence! The Role of Intuition and Non-Logical Reasoning inIntelligence* Xejournal of AlX** 2* 1971* pp, 209-225, Provocative,(ESS* P looking for philosophical implications of Al work)

Sussman* Gerald* XeA Computer Model of Skill Acoui si t i onX*,American Elsevier Publishing Company, New York, New York, 1975,,See writeuo in [Winston 1974](DR, li l earni ng as debugging)

XeThlrd International Joint Conference on Artificial Intelligence!Advance Papers of the Conf erenceX*, Stanford Research Institute,Menlo Park, California, 1973, xiv + 703 pages.(Col l ect ion)

"Turing! TEST, found in [C&T], Parodied in [Anderson ESSAYS],(ESS, 1 1 a yardstick that has weathered many a storm)

Uhr, Leonard, XePattern Recognition, Learning, and Thought!Computer-programmed Models of Higher Mental ProcessesX*,Prent ice*Hall,l l , Englewood Cliffs, New Jersey, 1973, ? + 506 pages,$13,95, Much more depth than will be expected.(DR, )

Waldinger and Manna, recent short SRI technical report will bemade available (SUM, lißeasonlng about programs)

Walker, Donald E,» and Norton, Lewis M,, editors, XeProceedi ngs ofthe International Joint Conference onGordon and Breach Science Publishers,715 pages, $?.??, The first IJCAI,(Collection; most of the articles are

Artificial Intel l igenceX*,New York, New York, 1969, x +outdated by now; worth skimming through)

Weiner, N, XeThe Human uses of HumanAnchor 1954, (ESS, P)

Beings! Cybernetics and SocietyX*,

"Weizenbaum, J,, ELIZA, XeCACMX*1966, 9, 36-45,(SUM, Hit's easy to pretend intelligence by reflective listening)

Wiekelgren, Wayne A,, XeHow to Solve Problems! Elements of aTheory of Problems and Prob! em-sol vi ngX*, San FraneiscolW.H, Freeman and Company, 1974, Integrates Newell and Polya's ideas,(DR, Ilßeconci 1 ing Polya and Newell)

)

I <FEIGENBAUM>AI,SYLLABUS;I SAT 19-JUL-75 7143AM

"Winograd, Terry, "Five Lectures on Artificial Intelligence",Stanford AIM-246* C5459, ADAOOOOBS/I WC, 93 pages, September 1974,(ESS, P)

"Winograd, Terry, A procedural mpde! of language understanding, inSchank and Colby (eds,)(SUM, liprocedura! representation, systemic grammar)

Winograd, Terry, XeUnderstanding Natural LanguageX*, AcademicPress, Inc., New York, New York, 1972, viii ♦ 191 pages, $10,00,See paperin Schank and Colby or in 5 Lectures for summary,(DR, liProcedural knowledge in an integrated system),

"Winograd, Terry, Frame. representat i ons and the declarative/proceduralcontroversy, to appear in Bobrow & Collins (1975), Copies will beavai lab1 abl c.(ESS, limodularitv of knowledge structures, frames)

Winston, P, H, (1972) The M,I,T, Robot* XeMaehine Intelligence 7X*,American Elsevier Pub,(SURV, liHeterarehleal systems)

Winston, Patrick H,, editor, XeThe Psychology of Computer VisionX*,McGraw-Hill Publishing Company, New York, New York, 1975,$18,00, MIT vision work, ♦ Minsky's FRAMES Paper,(Collection, each at least (DR/SUM, ))

"1M1T74) Winston et al, (1974) New Progress in Artificial Intelligence, MIT AlLab Report AI-TR-310, June, 1974,(SURV, Collection of summaries, an updated version of [Minsky and Papert PROGRESS]

Woods, William [ATN] Chapter in Schank and Colby,(SUM, IlAugmented Transition Net grammars)

"Woods, W, A, and Makhoul, J, (1973) Mechnieal Inference Problems 1nContinuous Speech Understanding, Xe3UCAIX*, pp, 200-207, This describesPartly-implemented system. For the final story* see Woods' article InlEEE Transactions on ASSP* February, 1975,(SUM, I llncremental simulation)

"Yaklmovsky, V, and Feldman* J, (1973) A Semantics-Based DecisionTheory Region Analyzer, Xe3IJCAIX** Advanced Papers pp 580-8,(SUM, lipruning using real-world constraints)

«"■»»»"«