
1970~1980
-  
    
- 1971
- 
    
    
    
    Kenneth Colby °¡ ÆíÁýÁõ 
    (paranoid) Ä¡·á¸¦ À§ÇÑ ÄÄÇ»ÅÍ ½Ã¹Ä·¹ÀÌ¼Ç PARRY 
    ¸¦ ¸¸µé´Ù.- Nils 
            J.Nilsson °ú  Richard Fikes ´Â ÃÖÃÊÀÇ °èȹ½Ã½ºÅÛ (Planning system) ÀÎ  STRIPS  ¸¦ °³¹ßÇÏ´Ù. ("STRIPS: A New Approach to the Application of Theorem 
    Proving to 
Problem Solving,")- DARPA (Defense Advanced Research Projects Agency) 
    ¿¡¼ ±¸¾î ÀÌÇØ (Spoken Language Understanding) ¸¦ 
    À§ÇÑ SUR
  (Speech Understanding Research) projects¸¦ ½ÃÀÛÇÏ´Ù. ±×°ÍÀº  HEARSAY,  HARPY,  HWIM ÇÁ·Î±×·¥ÀÇ µîÀåÀ» ¿¹°íÇÏ´Â 
    °ÍÀÌ´Ù.
    
    - ÃÖÃÊÀÇ 
  microprocessor (Intel 8008) °¡ ¹Ì±¹¿¡¼ µîÀåÇÏ´Ù.- ÃÖÃÊÀÇ 
    Æ÷ÄÏ¿ë °è»ê±â
  (Poketronic)
    
    °¡ ³ª¿À´Ù.- ÇÁ·Î±×·¥ ¾ð¾î Pascal
    ÀÌ µîÀåÇÏ´Ù.
    
- 1972  
    
- Edward 
            H. 
            Shortliffe (Stanford ÀÇÇйڻç, Bruce Buchanan 
    Áöµµ) ¿Í µ¿·áµéÀÌ  MYCIN À» ¸¸µé´Ù. °¨¿°¼º 
    Ç÷¾× ÁúȯÀ» Áø´ÜÇϰí, ȯÀÚ Ã¼Áß¿¡ µû¶ó Ç×»ýÁ¦¸¦ ó¹æÇÏ´Â Àü¹®°¡½Ã½ºÅÛÀÌ´Ù. 
    ±×µéÀº ¶ÇÇÑ rule µéÀÌ ¾î¶»°Ô Àû¿ëµÇ´ÂÁö¿¡ ´ëÇÑ ·ÎÁ÷À» Æ÷ÇÔÇÏ´Â Ãß·Ð ¿£ÁøÀ» 
    Áö´Ñ ÃÖÃÊÀÇ Àü¹®°¡½Ã½ºÅÛ shell EMYCIN À» ¸¸µé´Ù.  MYCIN Àº ¶ÇÇÑ È®·üÀû rule (probabilistic rule) 
    À» 
    ó¸®ÇÒ ¼ö Àִµ¥ ±×°ÍÀº DENDRAL ¿¡¼´Â ÇÒ ¼ö ¾ø¾ú´ø °ÍÀÌ´Ù. MYCIN Àº Àΰ£ Àǻ纸´Ù ´õ ÁÁÀº °á°ú¸¦ º¸À̱⵵ 
    Çß´Ù. Á¦ÀÛ ÁßÀÇ ¹ß»ýÇÑ ¾î·Á¿òÀº Àΰ£ Àü¹®°¡ÀÇ 
    Áö½ÄÀ» ÃßÃâÇÏ¿© rule ·Î ¸¸µå´Â °ÍÀ̾úÀ¸¸ç ±×°ÍÀº  Áö½Ä°øÇÐ 
(Knowledge Engineering) À̶ó°í ³ªÁß¿¡ ºÒ¸®°Ô 
    µÈ´Ù. - Hubert 
Dreyfus ´Â 
    ±×ÀÇ Àú¼  "Alchemy and AI" À» È®ÀåÇÏ¿© ´õ °ø°ÝÀûÀÎ  anti-AI book 
    ÀÎ "What Computers Can't Do."À» 
    Ãâ°£ÇÏ´Ù. - Alain Colmerauer °ú Phillipe Roussel °¡ 
    ÄÄÇ»ÅÍ ¾ð¾î Prolog  (PROgrammation en LOGique)¸¦ ¸¸µé´Ù. ±×°ÍÀº Horn Àý Çü½ÄÀ¸·Î¸¸ 
    ¾²¿©Áöµµ·ÏÇÑ ³í¸® ¹®Àå (¿¹¸¦ µé¸é IF...THEN) À» °ÈÇϱâ À§ÇØ 1974 ³â¿¡ 
    °³Á¤µÇ¾ú´Ù.  PROLOG ´Â 
    LISP ÀÌ Áö¹èÇÑ ¹Ì±¹ ÀÌ¿ÜÀÇ Áö¿ª¿¡¼´Â  °¡Àå ¼±È£ÇÏ´Â AI ¾ð¾î°¡ µÇ¾ú´Ù.- ÇÁ·Î±×·¥ 
    ¾ð¾î Smalltalk °¡ 
  Xerox PARC 
    
    ¿¡¼ °³¹ßµÇ´Ù. Alan Kay ¿Í Adele Goldberg 
°¡  Smalltalk ¸¦ °³¹ßÇߴµ¥ ±×°ÍÀº  object-oriented 
programming °ú  icon-oriented interfaces ÀÇ ´É·ÂÀ» °¡Áø°ÍÀÌ´Ù.- Cray Research formed
    
    - Nolan Bushell °¡ ÃÖÃÊÀÇ ºñµð¿À °ÔÀÓÀÎ 
     PONGÀ» ¸¸µé´Ù.- Terry 
            Winograd °¡ MIT ¹Ú»ç 
    ³í¹®¿¡¼ ¾î¸°ÀÌÀÇ Á¦ÇÑµÈ ºí·Ï ¼¼°è¿¡¼ ÄÄÇ»ÅͰ¡ ¿µ¾î ¹®ÀåÀ» ÀÌÇØÇÏ´Â °ÍÀ» 
    º¸¿©ÁÖ´Ù. ±×°ÍÀº ÀÚ¿¬¾î ÀÌÇØ ÇÁ·Î±×·¥  SHRDLU 
    ·Î¼ ¿µ¾î·Î ¹®¼ÈµÈ ¸í·ÉÀ» ¼öÇàÇÏ´Â ·Îº¿ ÆÈÀ» °¡Áö°í ÀÖ´Ù.-  
- 1973 
    
- James Lighthill °æ (Cambridge ´ëÇÐÀÇ 
    ÀÀ¿ë¼öÇÐÀÇ  
Lucasian Chair) ÀÌ ¿µ±¹ Á¤ºÎ¿¡ ´ëºÎºÐÀÇ AI ¿¬±¸¸¦ À§ÇÑ ÀçÁ¤Áö¿øÀ» Áß´ÜÇÒ °ÍÀ» 
    Ãæ°íÇÏ´Â º¸°í¸¦ ÇÏ´Ù.
    
    - Schank ¿Í  Abelson
ÀÌ  scripts¸¦ °³¹ßÇÏ´Ù.
    
    - ÃÖÃÊÀÇ  bit-mapped
  graphics-oriented monitor
    
    °¡ µîÀåÇÏ´Ù.- ´ëÇп¡ UNIX °¡ ³Î¸® º¸±ÞµÇ´Ù.- Xerox PARC ¿¡¼ 
    
  "Alto"¸¦ ¼³¸³ÇÏ´Ù (ÃÖÃÊÀÇ  hand-held mouse
    
    ¿Í ÇÔ²²). 
- 1974 
    
- DARPA ¿¡¼  MIT, Carnegie Mellon, 
 Stanford ÀÇ AI ¿¬±¸¿¡ ´ëÇÑ ÀçÁ¤Áö¿øÀÌ ½Ç¸Á½º·± ¿¬±¸°á°ú¿¡ µû¶ó Å©°Ô »ï°¢µÇ´Ù. 
    - Earl Sacerdoti ÀÌ ÃÖÃÊÀÇ 
planning program ÁßÀÇ ÇϳªÀÎ ABSTRIPS¸¦ °³¹ßÇÏ¿´À¸¸ç  hierarchical 
planning ±â¼úÀ» °³¹ßÇÏ´Ù.
    
    - ÃÖÃÊÀÇ 
  computer-controlled robot
    
    ÀÌ µîÀåÇÏ´Ù.- SUMEX-AIM network
(Stanford 
University Medical Experimental Computer for Artifical Interlligence in Medicine)
  ÀÌ ¼³¸³µÇ¾ú´Âµ¥ ±×°ÍÀº ÀÇÇп¡ AI ¸¦ ÀÀ¿ëÇϱâ À§ÇÑ °ÍÀÌ´Ù. Stanford 
    ÀÇ    
Edward Feigenbaum °ú  Joshua Lederberg ¿¡ ÀÇÇØ ÃßÁøµÇ¾î °úÇп¡¼ÀÇ Çùµ¿À» 
    À§ÇÑ  ARPAnet ÀÇ ÈûÀ» º¸¿©ÁÖ´Ù.     - Ahl Publishes
  "Creative Computing"
    
    - First SIGGRAPH
    
    - Nelson writes
  "Computer Lib"
     - Paul Werbos °¡  ¿ªÀüÆÄ (Back-propagation) 
algorithmÀ» °í¾ÈÇÏ¿´´Âµ¥ ±×°ÍÀº  multilayer neural networksÀ» °¡´ÉÇÏ´Â 
    °ÍÀÌ´Ù. ±×¸®°í simple Perceptrons À» ´É°¡ÇÏ´Â classification ¼öÇà ´É·ÂÀ» 
    °¡Áø °ÍÀÌ´Ù.  Back-propagation Àº 1980 ¿¬´ë ÃÊ¿¡ 
David Rumelhat ¿Í David 
Parkewas ¿¡ ÀÇÇØ µ¶ÀÚÀûÀ¸·Î Àç ¹ß°ßµÈ´Ù. 
- 1975 
    
- Marvin 
            Minsky °¡  "A Framework for 
Representing Knowledge," À» Ãâ°£ÇÏ´Ù. ±×´Â "AI ¿Í ½É¸®Çп¡¼ ´ëºÎºÐÀÇ 
    À̷еéÀÇ ±¸¼º¿ä¼ÒµéÀÌ ¼³¸íÇϱ⿡´Â ³Ê¹« »ó¼¼Çϰí, ±¹¼ÒÀûÀ̸ç, ºñÁ¶Á÷È 
    µÇ¾îÀִµ¥, ±×°ÍÀº »ó½ÄÀûÀÎ »ç°íÀÇ ¿µÇâ ¶§¹®ÀÌ´Ù" ¶ó°í ÇÏ¿´´Ù. 
    ±×´Â  "frames" À̶ó´Â ¿ë¾î¸¦ Á¦¾ÈÇÏ¿© ±× ¼Ó¿¡ ¿¹»óµÇ´Â ¼Ó¼º ("markers")À» 
    °¡Áø features (¼ÒÀ§ "terminals")¸¦ Ç¥ÇöÇÏ¿´´Ù. frames Àº ½Ã½ºÅÛ³»¿¡¼ 
    ¼·Î ±×·ìÀ¸·Î ³ª´µ°í ¿¬°áµÉ ¼ö ÀÖ´Ù. ¿¹¸¦µé¸é "Áý"À» Ç¥ÇöÇϱâ 
    À§ÇØ º®, â¹®, Çö°ü, ÁöºØ°ú °°Àº features¸¦ »ç¿ëÇÏ¿© frame matching ¿¡ ÀÇÇØ¼ 
    ÁøÂ¥ ÁýÀ» ÀνÄÇϴµ¥ »ç¿ëµÈ´Ù. Áý°ú ´Ù¸¥ frame Áï °¡°Ô, ±³È¸, Çб³ µîÀÌ 
    ¸ð¿©¼ ÇϳªÀÇ town ½Ã½ºÅÛÀ» ±¸¼ºÇÑ´Ù. ÀÌ·¯ÇÑ Áö½ÄÇ¥Çö ¼ö´ÜÀ¸·Î¼ÀÇ frame 
    ÀÌ·ÐÀ» ¹ßÇ¥ÇÏ¿© Å« ¹ÝÇâÀ» ÀÏÀ¸ÄÑ schema ¿Í semantic link ¿¡ °üÇÑ ¸¹Àº 
    idea¸¦ À¯µµÇÏ°Ô µÈ´Ù.- Meta-Dendral learning program ÀÇ 
    °á°ú·Î, ÃÖÃÊÀÇ ÄÄÇ»ÅÍ¿¡ ÀÇÇÑ °úÇÐÀû ¹ß°ßÀÌ °ü·Ã ÀâÁö¿¡ ¼ö·ÏµÇ´Â ÈÇко߿¡¼ÀÇ 
    »õ·Î¿î °á°ú(some rules of mass spectrometry) ¸¦ ³º¾Ò´Ù.
    
    - Cooper & Erlbaum
ÀÌ ½Å°æ¸Á ±â¼úÀ» À§ÇÑ  Nestor »ç¸¦ ¼³¸³ÇÏ´Ù.- ÃÖÃÊÀÇ 
     microcomputer
ÀÎ 
  BASIC ÀÌ  Gates ¿Í Allen
    
    ¿¡ ÀÇÇØ ¸¸µé¾îÁö´Ù.- ÃÖÃÊÀÇ Personal 
    Computer ÀÎ 
    
  Altair 8800 (256 bytes memory)
    
    µîÀåÇÏ´Ù.- DARPA ¿¡¼  image
  understanding funding program
    
    À» ½ÃÀÛÇÏ´Ù.- Larry Harris °¡ ÀÚ¿¬¾î󸮸¦ 
    À§ÇÑ 
  Artificial Intelligence Corp ¸¦ ¼³¸³ÇÏ´Ù.
    
     
- 1976
    
- Douglas 
Lenat ÀÌ Stanford ¹Ú»ç³í¹®À¸·Î 
     AM (Automated
  Mathematician)
    
    programÀ» ¹ßÇ¥ÇÏ¿©  discovery model (loosely-guided search for 
interesting conjectures) À» ½Ã¿¬ÇÏ´Ù.
±×°ÍÀº ±× ÀÚ½ÅÀÌ  number theory ¸¦  rediscover ÇÏ´Â ÇÁ·Î±×·¥ 
    À̾ú´Ù. ±×°ÍÀº ÀÏ·ÃÀÇ Ãʺ¸ÀûÀÎ idea, Áï ½ÇÇèÁ¤½Å°ú Á¤È®¼º(a sense of experimentation, and a sense of rightness of good 
discoveries to guide its activities)À» °áÇÕÇÑ °ÍÀ̾ú´Ù. À̸¦ À§ÇØ ¸¹Àº rule 
    (¶Ç´Â heuristics) ·Î¼ Ç¥ÇöµÇ¾ú´Ù.
    óÀ½ÀÇ µå¶ó¸¶Æ½ÇÑ ¼º°ø¿¡µµ ºÒ±¸Çϰí, °ð »õ·Î¿î 
    number theory ¸¦ ¹ß°ßÇϴµ¥ ÇѰ迡 À̸£·¶´Ù. Lenat ´Â ÁÖ¾îÁø heuristics ¿¡ 
    ÇѰ谡 ÀÖ¾ú±â ¶§¹®À̶ó´Â °ÍÀ» ±ú´Ý°í, ½º½º·Î »õ·Ó°í À¯¿ëÇÑ heuristics ¸¦ 
    ¹ß°ßÇϵµ·Ï âÁ¶ÇÒ Çʿ伺À» ´À³¢°Ô µÇ¾ú´Ù. 5³âÀÇ ¿¬±¸³¡¿¡ ±×·¯ÇÑ ´É·ÂÀ» »õ·ÎÀÌ 
    °®Ãá ÇÁ·Î±×·¥  EURISKO ¸¦ °³¹ßÇß´Ù. 
EURISKO Àº »ç¿ëÇÑ heuristicsÀÇ ¼º´ÉÀ» ÃßÀûÇØ¼  À߸ø ¼öÇàµÇ´Â °ÍÀº ¹èÁ¦Çϰí 
    ´õ Àß ¼öÇàµÇ´Â °ÍÀº ¼öÁ¤ÇÏ°í °³¼±½ÃÄ×´Ù. ±× ÇÁ·Î±×·¥Àº 3D computer 
chips ÀÇ ¼³°è¸¦ °³¼±Çϴµ¥ ¼º°øÀûÀ¸·Î »ç¿ëµÇ¾ú´Ù.¶ÇÇÑ space-war game, Traveller TCS 
    game ¿¡¼µµ ½º½º·Î ¹è¿ì´Â Çõ½ÅÀûÀÎ Á¢±Ù ¹æ¹ýÀ¸·Î 1982, 1983 ¿¬µµ °ÔÀÓ Ã¨ÇǾð 
    ÀÚ¸®¿¡ ¿Ã¶ú´Ù.
    
     - Randall Davis ÀÌ Stanford ¹Ú»ç³í¹®¿¡¼ 
     
meta-level reasoning ´É·ÂÀ» ½Ã¿¬ÇÏ´Ù.- ÃÖÃÊÀÇ 
    adventure °ÔÀÓÀÎ Adventure ÀÌ Crowther ¿Í 
  Woods ¿¡ ÀÇÇØ ¸¸µé¾îÁö´Ù.- Greenblatt ÃÖÃÊÀÇ 
    
  LISP machine ÀÎ  "CONS"À» ¸¸µé´Ù.
    
    - Raymond 
Kurzweil ÀÌ reading machine
    
    À» ¸¸µé´Ù.- David 
Marr ¿Í  µ¿·áµéÀº  
"primal sketch" ¿Í  visual perception¿¡¼ÀÇ ±× ¿ªÇÒÀ» ¹¦»çÇÏ´Ù..
    - Dynabook paper (Kay and
  Goldberg)
    
     
- 1977 
    
- Roger  Shank °¡ 
    °³³äÀÇÁ¸ 
    ÀÌ·Ð (Conceptual 
Dependency Theory) ¸¦ ¹ßÀü½ÃÄ״µ¥, ±×°ÍÀº scripts (»ç°ÇÀÌ ÀÏ¾î³ ÀüÇüÀûÀÎ 
    ¼ø¼¿¡ ´ëÇÑ °£·«ÇÑ À̾߱âµé, ¾î¶² »ç°Çµµ »ý·«ÇÏÁö ¾ÊÀ½...) ¸¦ »ç¿ëÇϰí, 
    »ç¶÷µéÀÌ ¸»ÇÑ À̾߱⸦ ÀÌÇØÇϰí Ãß·ÐÀ» ÅëÇØ¼ ±× À̾߱⿡ ´ëÇÑ Áú¹®¿¡ ´äÀ» 
    ÇÒ ¼ö ÀÖµµ·Ï, »ç¶÷µéÀÇ °èȹ°ú ¸ñÇ¥¿¡ ´ëÇÑ Áö½ÄÀ» »ç¿ëÇØ¼ ÀÌ·ç¾î Áø °ÍÀÌ´Ù. 
     
ÀÌ·¯ÇÑ °áÇÕÀº Janet 
Kolodner's CYRUS °°Àº ¾ð¾îÇØ¼® ÇÁ·Î±×·¥ÀÇ ¼º°øÀ» À̲ø¾ú´Ù. ±×°ÍÀº ½º½º·Î Cyrus 
    Vance ó·³ »ç°íÇÏ´Â °ÍÀ¸·Î¼, ½Å¹®±â»ç¸¦ º¸°í ±×ÀÇ ÀÏ»ó¿¡ ´ëÇØ ÇнÀÇÏ°Ô 
    µÇ¾î, 
    Vance ÀÇ ºÎÀΰú À̽º¶ó¿¤ ¼ö»ó Begin ÀÇ ºÎÀÎÀÌ ¹è¿ìÀÚµéÀÌ ÃÊ´ëµÉ °ÍÀ̶ó´Â 
    »çȸÀû Çà»ç¿¡¼ ¸¸³µ´Ù´Â °ÍÀ» ¾î¸²Àâ¾Æ ÃßÃøÇϱ⵵ (surmise) Çß´Ù. À̰ÍÀº ½ÇÁ¦·Î ÀÏ¾î³ 
    ÀÏÀÌ´Ù.  - Steve Wozniak  °ú 
     Steve Jobs °¡  Apple Computer
    
    ¸¦ ¼³¸³ÇÏ´Ù.- 3CPO and R2D2 star in
  "Star Wars"
    
    - Apple II, Radio Shack
  TRS80, Commodore PET
    
    - Conway & Mead codify
  VLSI design
    
    - Bill Gates °¡ Microsoft »ç¸¦ ¼³¸³ÇÏ´Ù.-  
- 1978
    
- Tom 
            Mitchell  ÀÌ  Stanford¿¡¼ °³³äÇü¼º 
    ÇÁ·Î±×·¥ÀÇ Å½»ö °ø°£(search space of a concept formation 
program)À» ¹¦»çÇÏ´Â ¹öÀü 
°ø°£ (Version Space) ÀÇ °³³äÀ» ¹ß¸íÇÏ´Ù. 
    - Herbert 
             Simon ÀÌ ³ëº§ °æÁ¦ÇлóÀ» ¹Þ´Ù. 
    "satisficing" À̶ó°í ¾Ë·ÁÁø AI ÀÇ ±âÃÊÁß ÇϳªÀÎ bounded rationality 
    ÀÌ·Ð À¸·Î ¼ö»óÇÑ °ÍÀÌ´Ù. -  MOLGEN ÇÁ·Î±×·¥ÀÌ 
     Stanford¿¡¼  
Mark Stefik ¿Í  Peter Friedland ¿¡ ÀÇÇØ ¸¸µé¾îÁ®, Áö½ÄÀÇ °´Ã¼ ÁöÇâ Ç¥Çö(object-oriented 
representation of knowledge) À¸·Î À¯ÀüÀÚ º¹Á¦ (gene-cloning) ½ÇÇèÀ» °èȹÇϱâ 
    À§ÇØ »ç¿ëµÉ ¼ö ÀÖ´Ù´Â °ÍÀ» º¸¿©ÁÖ´Ù.- David 
Marr ¿Í  Nishihara
  propose 2-1/2 dimensional sketch
    
    - Bricklin writes VisiCalc
    
    - Hayes announces
  Micromodem 100
    
    - SRI ÀÇ ±¤¸Æ Ž»ö Àü¹®°¡½Ã½ºÅÛ  PROSPECTOR 
  °¡ ¸ô¸®ºêµ§ ±¤¸ÆÀ» ¹ß°ßÇÏ´Ù.- Xerox LISP machines
    
    -  
- 1979 
    
- Bill VanMelleÀÇ  
Stanford ¹Ú»ç³í¹®¿¡¼ ±×°¡ ¸¸µç  EMYCIN program ¿¡¼ Ãß·ÐÀÇ ½ºÅ¸Àϰú MYCIN ÀÇ 
    Áö½Ä Ç¥ÇöÀÇ ÀϹݼºÀ» º¸¿©ÁÖ´Ù. ±×°ÍÀº ±× ÈÄÀÇ ¸¹Àº »ó¾÷¿ë Àü¹®°¡½Ã½ºÅÛ shell 
    ÀÇ ¸ðµ¨ÀÌ µÇ¾ú´Ù.- Jack Myers ¿Í  Harry Pople ÀÌ 
     Pittsburgh ´ëÇп¡¼  INTERNIST ¸¦ °³¹ßÇÏ¿´´Âµ¥, ±×°ÍÀº Áö½Äº£À̽º ÀÇ·áÁø´Ü ÇÁ·Î±×·¥À¸·Î¼ ÀÇ»ç Myers ÀÇ ÀÓ»óÁö½Ä¿¡ ±âÃÊÇÑ °ÍÀÌ´Ù. - Cordell Green, David Barstow, Elaine Kant 
¿Í Stanford µ¿·áµéÀÌ automatic 
programmingÀ» À§ÇÑ  CHI system À» ½Ã¿¬ÇÏ´Ù.-  Hans 
Moravec ÀÌ Stanford Cart 
    ¸¦ ¸¸µé¾ú´Âµ¥ ±×°ÍÀº ÃÖÃÊÀÇ ÄÄÇ»ÅÍ Á¦¾î autonomous vehicle À̸ç 
     chair-filled room and circumnavigates the Stanford AI 
LabÀ» ¼º°øÀûÀ¸·Î ÁÖÇàÇÏ´Ù..
    - Drew Mcdermott 
     ¿Í Jon Doyle (MIT) 
    ¿Í  
John 
            McCarthy (Stanford)°¡ °øµ¿À¸·Î  non monotonic logics ¿Í 
formal aspects of truth maintenance ¿¡ °üÇÑ Ãâ°£ ÀÛ¾÷À» ½ÃÀÛÇÏ´Ù. - "Pac Man"
  introduced
    
    - Compuserve and The
  Source are founded
    
    - ADA 
    
    - Patrick Hayes 
    : "The
  Naive Physics Manifesto"
    
    - Raj Reddy °¡ 
    Carnegie Mellon University
    
    ¿¡ Robotics Institute ¸¦ ¼³¸³ÇÏ´Ù.- MYCIN ÀÌ Àǻ縸ŠÈǸ¢ÇÑ °á°ú¸¦ º¸Àδٰí 
    Journal of American Medical Assoc ¿¡ º¸°íµÇ´Ù.
    
    - Publication of Weinreb
  and Moon's MIT AI Lab memo on Flavors, OOP °¡ Áøº¸µÈ ´É·ÂÀ» º¸ÀÌÁö¸¸ Lisp 
    ¾ð¾î family ¹Û¿¡¼´Â ¿©ÀüÈ÷ ÀϹÝÀûÀ¸·Î »ç¿ëµÇÁö´Â ¾Ê´Â´Ù.
     - backgammon ¼¼°è èÇǾðÀÎ ÀÌŸ®ÀÇ 
     Luigi Villa °¡ ÄÄÇ»ÅÍ ÇÁ·Î±×·¥¿¡ ÆÐ¹èÇÑ ÃÖÃÊÀÇ º¸µå°ÔÀÓ ¼¼°èèÇǾðÀ¸·Î 
    ±â·ÏµÇ´Ù. ±× ÇÁ·Î±×·¥Àº CMU ÀÇ  Hans Berliner °¡ ¸¸µç °ÍÀÌ´Ù. ±× ÇÁ·Î±×·¥Àº 
    ¸»ÀÇ ¿òÁ÷ÀÓÀÌ ¿Ã¹Ù¸¥Áö¸¦ ÃøÁ¤ÇÏ´Â weighted set of criteria¸¦ Æò°¡ÇÏ¿© ¸»ÀÌ 
    À̵¿ÇÑ´Ù. backgammon ¿¡¼´Â ³Ê¹«³ª ¸¹Àº °æ¿ìÀÇ ¼ö°¡ Àֱ⠶§¹®¿¡, chess¿¡¼ 
    »ç¿ëµÇ´Â ¹æ¹ýÀÎ °¡´ÉÇÑ ¹Ì·¡ÀÇ ¸»ÀÇ ¿òÁ÷ÀÓÀ̳ª ´ëÀÀÁß¿¡¼ Ž»ö ¹æ¹ý(alternative process of 
searching)À» »ç¿ëÇÏÁö ¾Ê¾Ò´Ù.-  
    
    -     