Àü¹®°¡½Ã½ºÅÛ°ú ÀÏ¹Ý ÇÁ·Î±×·¥°úÀÇ Â÷ÀÌ

 

ÀΰøÁö´ÉÀÇ ±â¹ý°ú ÀÀ¿ë : ±èÀçÈñ, ±³Çлç, 1988, Page 261~264 

 

 

Àü¹®°¡½Ã½ºÅÛÀ̶õ Àü¹®Áö½ÄÀÇ Æ¯Á¤ ¿µ¿ª¿¡ ´ëÇÑ Àü¹®°¡ÀÇ Áö½ÄÀ» ¿ä¾àÇÏ°í ±× ¿µ¿ª ¾È¿¡¼­ ÁöÀûÀÎ ÆÇ´ÜÀ» ³»¸± ¼ö ÀÖ´Â Software PackageÀÌ´Ù. Àü¹®°¡½Ã½ºÅÛÀ» Á¤ÀÇÇÏ´Â ´Ù¸¥ ¹æ¹ýÀº, À̸¦ º¸ÅëÀÇ ÇÁ·Î±×·¥°ú ºñ±³ÇÏ´Â °ÍÀÌ´Ù. °¡Àå ±âº»ÀûÀÎ Â÷ÀÌ´Â, º¸ÅëÀÇ ÇÁ·Î±×·¥ÀÌ data ¸¦ ó¸®Çϴµ¥ ¹ÝÇÏ¿© Àü¹®°¡½Ã½ºÅÛÀº knowledge ¸¦ ó¸®ÇÏ´Â °ÍÀÌ´Ù.

ÀÏ¹Ý ÇÁ·Î±×·¥

Àü¹®°¡ ½Ã½ºÅÛ

    µ¥ÀÌÅ͸¦ Ç¥ÇöÇÏ°í »ç¿ë

    ¾Ë°í¸®ÁòÀ» »ç¿ë

    ¹Ýº¹ÀûÀΠó¸®

    µ¥ÀÌÅͺ£À̽º¸¦ ó¸®

    Áö½ÄÀ» Ç¥ÇöÇÏ°í »ç¿ë

    ÈÞ¸®½ºÆ½À» »ç¿ë

    Ãß·ÐÀûÀΠó¸®

    Áö½Äº£À̽º

Àü¹®°¡½Ã½ºÅÛÀÇ Æ¯Â¡

1.  Àü¹®Áö½ÄÀ» Ãë±ÞÇÑ´Ù.(Knowledge)

µû¶ó¼­ °ü·Ã ºÐ¾ßÀÇ Àü¹®°¡¿Í °°Àº Á¤µµÀÇ ¼º°ú¸¦ ¹ßÈÖÇØ¾ß ÇÏ¸ç ¶ÇÇÑ  ºü¸£°Ô ÁÁÀº Çظ¦ ã¾Æ³»±â À§ÇØ È¿À²ÀûÀ¸·Î ±¸¼ºµÇ¾î¾ß ÇÑ´Ù. ¶ÇÇÑ Àΰ£°ú °°ÀÌ ³Ð°í ±íÀº Áö½ÄÀ» Á¦°øÇÒ ¼ö ÀÖ¾î¾ß ÇÑ´Ù.
½ÇÁ¦¿¡ À־´Â °ü·ÃºÐ¾ß¿¡ 2³â Á¤µµ Á¾»çÇÑ Àü¹®°¡ÀÇ Áö½Ä±¸Çö¿¡ ¸¸Á·ÇÏ´Â °æÇâÀÌ¸ç ¶ÇÇÑ Á¤È®ÇÑ Çظ¦ ±¸Çϱâ À§ÇÏ¿© ¹®Á¦¸¦ Ãà¼Ò ½ÃÄÑ Á¼Àº ºÎºÐ¿¡¼­ Á¤È®ÇÑ Çظ¦ Ãß±¸ÇÏ´Â °æÇâÀÌ´Ù.

2. ½Éº¼¿¡ ÀÇÇÑ Ãß·ÐÀ» ÇàÇÑ´Ù.(Symbol)

Àü¹®°¡»Ó ¾Æ´Ï¶ó Àü¹®°¡½Ã½ºÅÛÀÇ UserµéÀº Àΰ£À̱⠶§¹®¿¡ Àΰ£°úÀÇInteractiveÇÑ Áö½Ä±³È¯À» ÇÏ·Á¸é Àΰ£ÀÇ ¾Ö¸ÅÇÑ Ç¥ÇöµéÀ» Á¤·®È­ÇÏ¿© Àü¹®°¡ ½Ã½ºÅÛ¿¡ ±¸ÇöÇÏ¿© ºÒÈ®½Ç¼ºÀ» ÁÙ¿© ³ª°¡¾ß ÇÑ´Ù. ÀÌ·¯ÇÑ ½Éº¼ Ç¥Çö¿¡ ÀÇÇÑ ºÒÈ®½Ç¼ºÀº Certainty Factor³ª Fuzzy ÀÌ·ÐÀ¸·Î½á ±¸ÇöÇÏ°Ô µÈ´Ù.

3. ÈÞ¸®½ºÆ½À» ÀÌ¿ëÇÑ´Ù.(Heuristic)

¡°ÈÞ¸®½ºÆ½¡±ÀÇ Àǹ̴ ¡°ÀÚ±â ÈûÀ¸·Î ¾Ë¾Æ³»´Â Àڱ⠹߰ßÀûÀΡ±ÀÇ ÀǹÌÀÌ´Ù. µû¶ó¼­ Ç×»ó ¿ÇÀº °ÍÀº ¾Æ´ÏÁö¸¸ ´ëºÎºÐÀÇ °æ¿ì¿¡ ¿ÇÀº Á¤º¸¸¦ Á¦°øÇÑ´Ù.  
Graph Search °úÁ¤¿¡¼­ÀÇ ³ÐÀÌ¿ì¼±,±íÀÌ¿ì¼± Ž»öÀº ¸ñÇ¥ÀÇ À§Ä¡¿¡ ¹«°üÇÑ Blind Search ÀÌ´Ù. ±×·¯³ª ÈÞ¸®½ºÆ½ Search´Â °¡Àå °¡´É¼ºÀÌ ÀÖ´Â ¸ñÇ¥ÀÇ À§Ä¡¿¡ ´ëÇÏ¿© Ž»öÀ» ÇàÇÏ¿© ºÒÇÊ¿äÇÑ ÀÚ¿ø³¶ºñ¸¦ ÁÙÀÌ°Ô µÈ´Ù.
 À̶§ °¡Àå °¡´É¼ºÀÌ ÀÖ´Â À§Ä¡¸¦ ã¾Æ³»±â À§ÇÏ¿© Àü¹®°¡ÀÇ °æÇè¿¡ ÀÇÇÑ  ±ÔÄ¢(Rules of Thumb)À» ÀÌ¿ëÇϰųª ¶Ç´Â °¢ ´Ü°è¿¡¼­ÀÇ ¹Ù¶÷Á÷ÇÑ Á¤µµ¸¦ Æò°¡Çϱâ À§ÇÑ Ã´µµ·Î½á Evaluation FunctionÀ» »ç¿ëÇϱ⵵ ÇÑ´Ù.

4. ÀÚ±âÁö½ÄÀ» »ç¿ëÇÑ´Ù.(Metaknowledge)

ÀÌ´Â ½Ã½ºÅÛÀÌ °®´Â ÀÚ½ÅÀÇ »ç°í¿¡ °üÇÑ Áö½ÄÀ» ¸»ÇÑ´Ù. ÀÌ´Â Áö½Ä¿¡ ´ëÇÑ Áö½ÄÀ» ÀǹÌÇÑ´Ù. ¡°À̼ø½Å À屺ÀÇ ½Å¹ßÀº ¸î ¹®Àΰ¡¡±ÇÏ´Â Áú¹®¿¡ ´ëÇÏ¿© Àΰ£Àº ½±°Ô ¡°¸ð¸¥´Ù¡±´Â ´äÀ» ÇÏÁö¸¸ ÄÄÇ»ÅÍ´Â ÀÚ±âÀÇ Áö½ÄÀ» ¸ðµÎ °Ë»öÇÑ ÈÄ¿¡¾ß ´äÀ» ¾ò´Â´Ù.
±×·¯³ª Àü¹®°¡½Ã½ºÅÛÀº Rule·Î½á ¹®Á¦ÀÇ ¼º°ÝÀ» ÆľÇÇÏ¿© °á·ÐÀÇ Á¤È®¼º,ÀÏ°ü¼º,°¡´É¼ºµéÀ» °ËÅäÇÏ¿© Ãß·ÐÇÑ´Ù. À̸¦ À§Çؼ­ explanation facility¸¦ °¡Áö°Ô µÇ¸ç Why  (¿Ö Àü¹®°¡½Ã½ºÅÛÀÌ ±×·± Áú¹®À» Çϴ°¡¸¦ º¸¿©ÁØ´Ù), How  (¾î¶»°Ô Çؼ­ Àü¹®°¡½Ã½ºÅÛÀÌ ±×·± °á·ÐÀ» ³»·È´Â°¡¸¦ º¸¿©ÁØ´Ù) µîÀÇ ÀÚ¹®¿¡ ÀÀÇÏ°Ô µÈ´Ù.  

 

Ư¡

conventional program

expert system

Á¦¾î (control by...)

statement order

inference engine

control and data

implicit integration

explicit separation

control strength

strong

weak

solution by..

algorithm

rules and inference

solution search

small or none

large

problem solving

algorithm is correct

rules

input

assumed correct

incomplete, incorrect

unexpected input

difficult to deal with

very responsive

output

always correct

varies with problem

explanation

none

usually

applications

numeric, file, and text

symbolic reasoning

execution

generally sequential

opportunistic rules

program design

structured design

little or no structure

modifiability

difficult

reasonable

expansion

done in major jumps

incremental