07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE....

5
* 07. 22 THU 4 NOV 76 Page 1 <SJORD>NEW-OUT LINE. 3 m A I Handbook Articles i. INTRODUCTION A. Philosophy NEED ERLS3 B. Relationship to Society NEED EPMc3 C. History [PMc 3 D. Conferences and Publications NEED E53 11. HEURISTIC SEARCH A. Heuristic Search Overview NEED ENiIJ B. Search Spaces 1. Overview done E 3 2. State-space representation done E63 3. Problem-reduction representation done [33 4. AND-OR trees and graphs done E43 C. "Blind" Search Strategies 1. Overview done [ 3 2. Breadth-first searching done E23 3. Depth-first searching done L23 4. Bi-directional searching done [ 3 5. Minimaxing done E33 6. Alpha-Beta searching done E33 D. Using Heuristics to Improve the Search 1. Overview done E73J 2. Best-first searching done E43f 3. Hill climbing done E33 "4. Means-ends analysis done E33 5. Hierarchical search, planning in abstract spaces done E 3 6. Branch and bound searching done E43 7. Band-width searching done E 3 E. Programs employing (based on) heuristic search 1. Overview NEED E73 2. Historically important problem solvers a) GPS done C 3 b) Strips done E 3 c) Gelernter 's Geom. Program NEED E33 111. Natural Language fyt A. Overview - History 8. Issues done [ 3 B. Representation of Meaning (See section XIV) C. Grammars and Parsing y~~~\ ~\ 1. Ov-e_rView_v of formal grammars done tPSIy 2. Extended grammars a. transformational grammars done EJS-3 P_» b. systemic grammars done EJED3 c. Case Grammars Bruce (AI Journal, 1/76) done CJED3 3. Parsing techniques a. Overview of parsing techniques NEED E63 _ >(\ b. augmented transition nets, Woods done ij?3 WO Ac. CHARTS - well formed substrings done ["J*] "% GSP syntnn ft pnrtirr done E-3^

Transcript of 07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE....

Page 1: 07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE. 3 m AI Handbook Articles i. INTRODUCTION A. Philosophy NEED ERLS3 B.

*07. 22 THU 4 NOV 76 Page 1 <SJORD>NEW-OUT LINE.

;

3

m A I Handbook Articles

i. INTRODUCTIONA. Philosophy NEED ERLS3B. Relationship to Society NEED EPMc3C. History [PMc 3D. Conferences and Publications NEED E53

11. HEURISTIC SEARCHA. Heuristic Search Overview NEED ENiIJB. Search Spaces

1. Overview done E 32. State-space representation done E633. Problem-reduction representation done [334. AND-OR trees and graphs done E43

C. "Blind" Search Strategies1. Overview done [ 32. Breadth-first searching done E233. Depth-first searching done L234. Bi-directional searching done [ 35. Minimaxing done E336. Alpha-Beta searching done E33

D. Using Heuristics to Improve the Search1. Overview done E73J2. Best-first searching done E43f3. Hill climbing done E33

"4. Means-ends analysis done E335. Hierarchical search, planning in abstract spaces done E 36. Branch and bound searching done E437. Band-width searching done E 3

E. Programs employing (based on) heuristic search1. Overview NEED E732. Historically important problem solvers

a) GPS done C 3b) Strips done E 3c) Gelernter 's Geom. Program NEED E33

111. Natural Language fytA. Overview - History 8. Issues done [ 3B. Representation of Meaning (See section XIV)C. Grammars and Parsing y~~~\ ~\

1. Ov-e_rView_v of formal grammars done tPSIy2. Extended grammars

a. transformational grammars done EJS-3 P_»b. systemic grammars done EJED3c. Case Grammars Bruce (AI Journal, 1/76) done CJED3

3. Parsing techniquesa. Overview of parsing techniques NEED E63 _ >(\b. augmented transition nets, Woods done ij?3 WO

Ac. CHARTS - well formed substrings done ["J*]"% GSP syntnn ft pnrtirr done E-3^

Page 2: 07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE. 3 m AI Handbook Articles i. INTRODUCTION A. Philosophy NEED ERLS3 B.

Page 2 <SJORD>NEW-OUTLINE07 22 THU 4 NOV 76

"IV

"

"

D. Famous Natural Language systems1. Early NL systems (SAD-SAM through ELIZA)2. PARRY (See Section Vile)

done E*3

3. MARGIE4. LUNAR

NEED [JED 3done [ f5"^D3NEED CAS35.

SHRDLU,

Winograd6. H. Simon - problem understanding (ft^-ty

E. Machine TranslationNEED C 3

1. Overview & history done [*J

done L"AB3done C 3done [ 3

2. Wilks' machine translation workF. Text Generating systemsG. Query languages

AI LanguagesA. Early list-processing languagesB. Language/system features

done C3l

done [ 3done Ea»"3done [ 3NEED [63NEED [53

0. Overview of current LP languages1. Control structures* -what—I angua g c a—»h_H)2. Data Structures (lists/ associations/3. Pattern Matching in AI languages4. Deductive mechanisms

C. Current languages/systems1. LISP/ the basic idea2. INTERLISP3. QLISP (mention QA4)

4. SAIL/LEAP5. PLANNER6. CONNIVER7. SLIP8. POP-29. SNOBOL

done [23done [ 3done C33done [23.frdone C23done [23*done [ 3done C 3done E 3( see thm.10. QA3/PROLOGUE ov. 5or

AUTOMATIC PROGRAMMINGA. Overview done [73

done [ 3done E 3doneC33doneL33

B. Program Specification TechniquesC. Program Synthesis techniques

1. Traces2. Examples3. Problem solving applications to AP

a. Sussman's Hackerb. Program Synthesis by Theorem Proving

doneC23doneE33NEED E 63NEEDC73done [ 3done C 3done C 3

4. Codification of Programming Knowledge5. Integrated AP Systems

D. Program optimization techniquesE. Programmer's aidsF. Program verification

Page 3: 07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE. 3 m AI Handbook Articles i. INTRODUCTION A. Philosophy NEED ERLS3 B.

Page 3 <_5JORD>NEW-OUTL I NE ; 307: 23 THU 4 NOV 76

"

VI. THEOREM PROVINGA. OverviewB. Resolution Theorem Proving

1. Basic resolution method2. Syntactic ordering strategies3. Semantic & syntactic refinement

C. Non-resolution theorem proving1. Natural deduction2. Boyer-Moore3. LCF

D. Uses of theorem proving1. Use in question answering2. Use in problem solving3. Theorem Proving languages4. Man-machine theorem proving

E. Predicate CalculusF. Proof checkers

VII. Human Information Processing — PsychologyA. PerceptionB. Memory and Learning

1. Basic structures and processes in IPP2. Memory Models

a. semantic net memory models (Quillian/ LNR)

b. HAM (Anderson

_.

Bower)c. EPAMd. Productions as m. models (Newell & Simon)

C. Psychol inguisticsD. Human Problem Solving — Overview

1. PBG's2. Human chess problem solving

E. Behavioral Modeling1. Belief Systems2. Conversational Postulates (Gricez TW)

3. Parry

VIH. VISIONA. OverviewB. Polyhedral or Blocks World Vision

OverviewGuzmanFa IkWaltz

done E 3

done E43done C23done [23

done [3 3NEED C 3NEED I 3

done [33done [63done [ 3done E 3done E53NEED E 3

MNEED D*WT3

done E 3

done C 3NEED EEAF3

NEED EPWT3done [ 3done El3NEED E6 3

done C 3NEED C53NEED [53

done [ 3done E23done [ 3done E 3

0

"NEED [PH3

Page 4: 07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE. 3 m AI Handbook Articles i. INTRODUCTION A. Philosophy NEED ERLS3 B.

"

07:23 THU 4 NOV 76 Page 4 -CSJORD>NEW~OUTLINE.

;

3

C. Scene AnalysisOverview NEED EPH3Template Matching done E 3Edge Detection done E43Homogeneous Coordinates done E73Line Description done E43Noise Removal done E43Shape Description done E43Region Growing (Yakamovsky, Olander) done E33Contour Following NEED E43Spatial Filtering NEED E43Front End Particulars done E 3Syntactic Methods done E 3Descriptive Methods done E 3

D. Robot and Industrial Vision SystemsOverview and State of the Art done [ 3Hardware NEED EB3

E. Pattern RecognitionOverview done EB3Statistical Methods and Applications NEED E93Descriptive Methods and Applications NEED EB3

F. MiscellaneousMultisensory Images NEED E73Perceptrons done E 3

IX. SPEECH UNDERSTANDING SYSTEMSA. Overview (include a mention of ac. proc. ) done E33

"B. Integration of Multiple Sources of Knowledge NEED E93C. HEARSAY I done E43D. HEARSAY II done E53E. SPEECHLIS done E23F. SDC-SRI System (VDMS) done E 3G. DRAGON done E63

X. ROBOTICSA. Overview done E 3B. Robot Planning and Problem Solving done E 3C. Arms . done E 3D. Present Day Industrial Robots done E 3E. Robotics Programming Languages done E 3

XI. Applications-oriented AI research (overview) NEED EB3A. Chemistry

1. Mass spectrometry done C632. Organic Synthesis - overview NEED EB3

B. Medicine1. MYCIN doneEl32. Others NEEDE73

C. Psychology and PsychiatryProtocol Analysis (Waterman and Newell) done E .1

D. Math systems1. REDUCE done E 32. MACSYMA (mention SAINT) done L" 3

Page 5: 07. THU NOV 76 Page - Stanford Universitymm610pb0319/... · 07.22 THU 4 NOV 76 Page 1 NEW-OUTLINE. 3 m AI Handbook Articles i. INTRODUCTION A. Philosophy NEED ERLS3 B.

07:23 THU 4 NOV 76 Page 5 <SJQRD>NEW-OUTLINE. ; 3

E. Business and Management Science Applications1. Assembly line balancing (Tonge) done [ 3

Electric power distribution systems done E 3F. Miscellaneous

1. LUNAR (See IIID4) done [ 32. Education done E 33. SCHOLAR done E 34. SOPHIE done [ 35. SRI computer-based consultation done C 36. RAND—RITA production rule system done E 3

I. MiscellaneousOverview of music composition and aesthetics done E73

XII. Where do these go ?Reasoning by analogy done E43Intelligence augmentation done [53Chess done L's3Heuristic Compiler done E 3Games done E 3Productions (put into prod, systems?) done E 3

XIII. Learning and Inductive InferenceA. Overview NEED [93

B. Samuel Checker program done [ 3C. Winston — concept formation done [23D. Pattern extrapolation problems —

Simon,

done [ 3E. Overview of Induction

" F. AQVAL (Michalski at U. 1 1 1 )

G. Parameter adjustment of linear functions done E 3H. Rote learning done [ 3I. D. A. Waterman's machine learning of heuristics done E 3J. Learning by debugging done E 3K. Learning by parameter Adaptation done E 3L. Signature & move phase tables done E 3

XIV. Representation of KnowledgeA. Overview NEED EAB3B. Representation Schemes

1. Predicate calculus2. Semantic nets done E 33. Production rules4. State spaces5. Procedures (actors, demons)

6. Frames7. Componential analysis8. Scripts9. KRL NEED CAB 3

10. ATNs (see Natlang) done E 311. Query languages (see Natlang) done E 312. FOL13. Multiple Knowledge sources - Blackboard