0% found this document useful (0 votes)
29 views5 pages

#12 Simplification Rule

Easy notes of artificial intelligence topic simplication rules

Uploaded by

Nishaa Latif
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
29 views5 pages

#12 Simplification Rule

Easy notes of artificial intelligence topic simplication rules

Uploaded by

Nishaa Latif
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
a Hrference:- oF computers which can create new _logic from | hh atiliccal intelegence_we need intelli at old logic or by evidence , $0 generating Levy the conclusions from evidence and _facts is lormed as __ inference Tference _rules:- | Thhovence rules ave the _ templates for generating valicl arguments Trference_tules applied to derive proofs in _ artificial axe intelligence, and the proof is the sequence ! F of the conclusion thot ead; to the desired _ goal. erminologies of _ inference _tules:- = Imp) i cation . L t = Converse = Contropos itive > Inveise Troplcation= of the logical connectives TR is one which con _be_vopmsented a8 P25 a Ses o boolen __ expression. P 4 Pae ite i 7, T F F e F ls Tt E F ie Converse:- __ The converse of implication » which mean the right hand Proposition goes to__ the lef hand side. It can be written as gp and it can be read as q_Imples _p. } 5 E dese ene ie T i q if F T F ae F ma F fe e nt va. positive: eee | —f--— Bergan of converse is termed) —_l as contvapositive and it can ce | -tepreserted as ep. Ses zB v “4 oP oS Tale a ck T F di | ; A fy a Se epee ne r | = iH 4 ea the _ negation _of ienphicaction is called i inverse. It can be representecl as | CT fepoeg. — P mw dd oy Ape, ee t | : F ay T Ff[rjrle E foe ed i Types Inferen ce. Rules:- fe > Modus a => Modus Tollens > Hypothetical syllogism > Disjunctive Syllogis™ . > Addition _ bad Simmpldication ad Reselution Sin im lficotio ation Rales:- iat wule:_stale that = Pad is rue ___ the ave will abo | Cie eee Example:- o_I will make. tea. |» It is vainin > Tk is _not_taining , 0 7 L will read | : a. book. L_ will > Frerefre I will make lea. 0F Yead a _book- Resolution eta Upv9 )Alopv7)) =) (4X) P % Pay foie a = fen I = F E F Rewrite Rules:- |____write_(something) agin especially es diferent way inorder to improve it or to include new infor matia Example: “A sentence (8) can be Yewritten | ee as a _noun phrase (NP) lus Verb phrase VP) + S45 NPsyp and the: verb phrase __can_be Nritter J ay a verb (V) ply a noun hrase _ LWP): WP > VENP. Abo calleof a | phrase structure mules | Meta rules define knowledge about 1 how the system _will__work- _Exarnple:- f ; Meta rules might define that knowledge | from _Expert_f is to be 4yusted move j f f then knowledge Frorn Expert B. \ Meto rules are tyeated by the I | systern Icke normal ules, but ave given [| highey priority E ner 4 | | | - i |

You might also like