HOME / ¹®¼­°øÀ¯ / /

(¿µ¹®) Ãß·Ð ¹× ÇнÀ - ½æ³×ÀÏ 1page
1/20
  • 1 page
  • 2 page
  • 3 page
  • 4 page
  • 5 page
  • 6 page
  • 7 page
  • 8 page
  • 9 page
  • 10 page
  • 11 page
  • 12 page
  • 13 page
  • 14 page
  • 15 page
  • 16 page
  • 17 page
  • 18 page
  • 19 page
  • 20 page

(¿µ¹®) Ãß·Ð ¹× ÇнÀ

¼­½Ä¹øÈ£
TZ-SHR-1046566
µî·ÏÀÏÀÚ
2019.08.04
ºÐ·®
20 page / 1.11 MB
Æ÷ÀÎÆ®
700 Point ¹®¼­°øÀ¯ Æ÷ÀÎÆ® Àû¸³¹æ¹ý ¾È³»
ÆÄÀÏ Æ÷¸Ë
Microsoft PowerPoint (pptx)
Èıâ Æò°¡

0

0°ÇÀÇ Èı⺸±â

µî·ÏÀÚ

ky***** °ñµå

µî±Þº° ÇýÅú¸±â

(¿µ¹®) Ãß·Ð ¹× ÇнÀ¿¡ ´ëÇØ ±â¼úÇÑ ¸®Æ÷Æ® Âü°íÀÚ·áÀÔ´Ï´Ù.

  • Microsoft PowerPoint (pptx)Microsoft PowerPoint (pptx)
Ãß·ÐÇнÀÃ߷й×ÇнÀ
¿¬°ü ÃßõÀÚ·á
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #1    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #2    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #3
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #4    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #5    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #6
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #7    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #8    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #9
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #10    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #11    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #12
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #13    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #14    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #15
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #16    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #17    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #18
 (¿µ¹®) Ãß·Ð ¹× ÇнÀ #19    (¿µ¹®) Ãß·Ð ¹× ÇнÀ #20    

  reasoning with rules  production systems (»ý¼º½Ã½ºÅÛ)  
rule-based systems (most of the expert systems) are sometimes called ¡°production systems using rules¡± or simply ¡°production systems¡±.
production system consists of fact base, rule base and inference engine (reasoning module).
fact base (short-term memory or working memory): a set of facts rule base (long term memory): a set of rules:
form if <condition> then <results> ¡¦.or actions in <results>.
inference engine: applies an applicable rule to facts (rule triggering,
or rule firing) to find new fact or to perform an action.
-needs conflict resolution (Ãæµ¹ÇؼÒ)-select one rule to apply (depth first, best first, etc.) ex.dfs, bfs, b&b, bestfs,a*
facts  rules  ie  inferred facts  actions  53    forward chaining  54  
ex.did wilma love barney?
state consists of:  
man(fred), man(barney),woman(wilma), spouse(fred,wilma), friend(fred, barney)
rules are:  if man(x) or woman(x) then person(x)  
if person(x) and spouse(y, x) and friend(y, z) then ~love(x, z),
¡¦  steps  
woman(wilma) applied to first rule ¢¡ person(wilma) person(wilma) and spouse(fred,wilma) and friend(fred, barney) applied to second rule ¢¡ ~love(wilma, barney)
  backward chaining  55  example  ~love(wilma, p)  ¡è z/p  person(wilma), spouse(y,wilma), friend(y, z)  ¡è fred/y  person(wilma), friend(fred, z)  ¡è barney/z  person(wilma)  ¡è  woman(wilma)  ¡è  none (the goal is proven)  
-interpretation using substitution list: ~love(wilma, barney)
  non-monotonic reasoning  (ºñ´ÜÁ¶Ãß·Ð)  
sometimes, old fact needs to be taken back.
wet(grass) and if rains(x) then wet(x), we concluded rains(grass).
but later, find sprinkler-on(grass), then we need to retract the fact
rains(grass).
in this case, production system needs to perform non-monotonic reasoning.
to perform non-monotonic reasoning, production system sometimes maintains a tms(truth maintenance systems) to maintain truth values for all clauses in working memory, instead of retract the facts.
ex) rains(grass)[0] where [1] true, [0] uncertain, [-1] false
56    handling uncertainties  57  
in reality, almost everything is uncertain.

especially in natural and social systems. ex   (ÀÌÇÏ »ý·«)

¹ÞÀº º°Á¡

0/5

0°³ÀÇ º°Á¡

¹®¼­°øÀ¯ ÀڷḦ µî·ÏÇØ ÁÖ¼¼¿ä.
¹®¼­°øÀ¯ Æ÷ÀÎÆ®¿Í Çö±ÝÀ» µå¸³´Ï´Ù.

Æ÷ÀÎÆ® : ÀÚ·á 1°Ç´ç ÃÖ´ë 5,000P Áö±Þ

Çö±Ý : ÀÚ·á 1°Ç´ç ÃÖ´ë 2,000¿ø Áö±Þ

ÈıâÀÛ¼º»ç¿ëÈı⸦ ÀÛ¼ºÇÏ½Ã¸é ¹®¼­°øÀ¯ 100 point¸¦ Àû¸³ÇØ µå¸³´Ï´Ù.

¼­½Äº°Á¡ ¡Ù¡Ù¡Ù¡Ù¡Ù

0/120

»ç¿ëÈıâ (0)

µî·ÏµÈ ¸®ºä°¡ ¾ø½À´Ï´Ù.

ù¹ø° ¸®ºä¾î°¡ µÇ¾îÁÖ¼¼¿ä.

ÀÌÀü1´ÙÀ½