0% found this document useful (0 votes)
41 views16 pages

Knowledge Representation

The is a beautiful hand written topic of artificial intelligence which is knowledge representation

Uploaded by

mqasim sheikh5
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)
41 views16 pages

Knowledge Representation

The is a beautiful hand written topic of artificial intelligence which is knowledge representation

Uploaded by

mqasim sheikh5
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
You are on page 1/ 16
[ Knowleal Representation jis i \ What __is knowledge? : > Facts , information _and_ skills acquired through or education; the theoretical or practical understanding of a subject. > __ knowledge = _information+ rule What is Knowledge _Representati Knowledge _ representation iso. relation shi \___|between two domains —_ Knowledge Yepresenta: io = |KR) isthe field _ of artificial _intelligence||_ ~—|that___vepresenting information about || the world in the form of computer system , that can solve complex __tasks such as diagnosing» medical conditidh . [problem a4 solution] | representation output Types of Knowledge:- = __hoce dural Knowledge > Declarative knowledge => Meta knowledge => Heuristic knowle dae + Strueluval knowledge _ = ma Procedural _ Knowledge:- how_to t Gives _ information [Knowledge abou i ing. acheive something “idles. sed of Describe how todo _things P Ja Drisch in__ tasks. divections of how to perform certain Procedural knowledge , also known 4s led imperative _knowleclge > 1s the knowie aGe. of some exercised in __ the _ performance ! task. Bi depend on _tavgets and problems. Example:- How to drive a car? Declarative koowledge:- ‘TE about statements that describe on particular object _and its _ attributes, v e including some _ behavior in relation with i. Can this knowledge be true ov false) V iis non-proceduyal , independent af IL E | targets and oblem solving. | piagmee Ts cu9y teday oe 1 Foo ee 15 ul of i | | | knowledge:~ Ta _knowledge about knowledge and how to gain _them. Example~ The _ knowledge that blood pressure _is more. important for diagnosing. a_medical conalition than eyes color: Heuristic _knowledge:- o field ov subject - Rules of thumb. Heuristic knowledge ave shallow Knowledge - Houristic Knowledge ave apposed to deterministic. Structural knowledge _ || Describe what vélationships _ exist _ between | of some expert _in sometimes called empitical as | __ | concept (objects - i Describe steucture_and__ their Example - How to various part of car_fit together to make a car structures in terms _of |_subconcepts and objects. relationship. ot_knowledad| concepts. — cee Techniques (odd bb ou Logical Representation . |? Rroduction Rule ~ > Semantic _Nelwprk K => Frame representation —t > Script Logical Represenation:- In order give information b agent!) - and get _ inf without _ evvors 19 communi There aye two types of LR. | > Propositional Logic > Fivst order Predicate logic_(Fot.) B. sitional fic — : pzoposi jon _is iti Classifiect as a declavative sentence which is eithey true or __false eg. +1 2 2 (D) 241-4 (F) a ox aap intax Semantic to define meaning ) | / \ Toe : —- jf atomic Complex Rtomic:- his isa single _proposition _and cconleins _a single statement __that_will be either _tyue oy fake. eg. Sky is blue = antains two ov move _ that _ fiw | statements . | S mbols- te E | = Negation is v__Disju ction (OR) ct ph Conju ction (AND). | > Implies (1, then) Iff Uf and only if ) |p» => “wwe shoul eat ig Watch TH ot | D v4 ——— | niuction:- i } 4 i i ) } isch isi ii ioalaalaalacd | She is waiting and using phone. pa She is waiting _ pay asada Teoplies:- “ FF thee is vain then wad i,_wel. 4 | p=) There _is_rain t | | og 2) Road is wee. j 4 | [ p24 i Iwill qo to the Mall iff ——— (1 have to do shopp. ing. Lipa 1 wil go to the Mal Lg 2 I have to db You can_access internet from ca a Pp put a => ‘ou ave CS student y= You ave oot fresher paaver) First order hredicate Logic. :- FOPL was developed to extend the 1 7 expe sciveness of Propositional Logic’. It is geneval-zation of PL__that peas reasoning __about would _entitid (obje tts) and __ subclasses of as well as classes objects - 7 Predicote Logic __uses variables ani quantifiers which is _not _present in propositional logic Examples:- The _ball__coby is Red. lala color (Ball , Red) t T ; Predicate azqument | objects ili Rohan _ likes Bananas. likes (Rohan, Bananas ) All students are intelligent - Rohan is _a__student - Rahan is _ intelligent - = a We need quantifiers to express English wards _, involve all _and_some. I; universal quantifier Existential quantins IL Y_(foy all) FZ (there exist, eg. Pp 4, ks Everybody | hates somebody VP3q =) hates (Pq) Production Rule:- > || consist of condition, action > paivs- f > | Agent check if a condition holds then give a new _ situation (state) - = | Production wules are belong 40 and same as propositional logic - tt 3. Semantic Netmorke These tepvesent knowledge _in__the hrm of _qrephieal nelinarks”” t © Semantic networks works as an alterndtive of predicate logic. for _ Knowledge _vepwe sentation. In "gemantic network. you _can yepresent | knowledge __9 the form of _ qyaphical network This _etwork consist of _ nodes and _atcs__ whith between those! yepre senting objects describe thee lationship objects - Tom _ is cat: erect : in color: Tom __is_ grey _ Tim_is__ mammal: Tim__is owned by Sam: Cat__is__@ mammal. Example 2. lom is cat. Toro caught a bird. | Torn is owned pb John. yp ct by Torn is ginger in coloy. Cates like C¥eam « ——__ Cat sat on the mat - Antti mamma |. —___] ——__| A bird is an animal. All mammals aye animal. Mammals have fouy legs. oe (as Frame _ Representation:- tames ave recor _ like structures that of a collection of slots 0” and the arresponding _ slots name and values called facts | contains _shts_and filles where represent objects , facts __and precedes (rules _ by which we move from| to destipnation ) and — fillers attributes - ave also Known _as kno viledge - eclaxative Frames: A frame — that contain description —_| aleut object “is called declar tive /. descriptive | factual frame {ype inEst Exareple:- Root Name: schoo! = (class¥oomy =~ a J (Clatioom] Libvary classyoom Lab] (Library|+~ [BeFsectons) = = aa | No-of sec bons, [pes of books INo- OF beni \ leaf — ir “Lab yo ype: | Seta} Scraeabt fempe] vidal af | Ree ‘Tisierg] [aera Res go [apes Pak: stuclies [Bicleas} Cheras: Zi Proc: luxa]__ Frame: his ame___contains | lots i frames 2 action _ procedural Remes —Atin of _ Slot:- 2 ion ae = [S—S—- TE contains information about: Object _Shot - is * =e 2 1 I contains information abou object which is being apetaled on. Source Slot Ed fl. TE contains information about the Source problem. Destination Slot:- ~_ TE contains information about _ the destination. izean Task__Shot:- Tt contains information about actions which will _be performed __| Example:- Problem: Saving _new file computer. ——— v ry Name: Saving a en file action slot object slot User Gile] courcle slot destination sbt computer} [computer] task 2 task 2 task 3 I create. new file click 9p save choose location Credle new action slot {usee) source sbt destination si [compile] ( task 4 ake Z Create blank, vinleon | ". {. veo Fite file I, Sexi of describe scheme = too frame, but instead ae] Ci] Oo knowledge ve Ne resentation, describing an object , the Script ia a sequence of events... Like the ie the script otras | tis a stereotyped situation. Unlike the trarye usually presented in a. particulax context. Io describe a sequen, 4 of events the script ses i a Serie 's lof sts containing —inbrmation about | the people » Objects and actions tet | — are involved in the events. E- it Some elements of a ‘typical script . AA _ include entry condition s, props , roles tracks and scenes. Entyy Condition :- Describes condition that must be satisfied before events in ths sevipt__can occur ov be valid. — ___|Bops:- | fers to the objects that are fined r inthe Sequence of events that occur. Tee Refers, to _ the people. involved in the | Script: The ___vesult _is conditions _ that _exist re the events inthe script have occurred. (Frack:- Refers to the variations that might _occur ino _ particular script - | cenes:- | Describe the actual sequence of events that occur: - Example: Restaurant Script | ae ET Food Relaurant | Roles : Customer (a2) Sesver (S) i) Props: Counter Tray, Food, Mone *r0PS: i Salt/ Pepper | Catsup/ straw ins ! epper | Cats p. S| Napkin ) ee * r Entry conditions: Customer is hungry, Customer has money}. —— Scene 1: Entr > Customer pasks cay { > Customer enters in __vestaurant: countey_- > Customer waits in ine at => Customer yeas meny & make aleck ion - Scene 2: Ordey - ———_ > Customer gives order tw server. > Server fills order by putting food on tra = Customer pays server. Scene 3: Eating [Take Out (takes food and ext), ro Customer get napkins 5 straws, salt, etc. 2 Takes tray tb an unoccupied table. > Customer eats food. Scene 4: Exit > Customer Cleans up lable _% discard trash > Customer leaves Yestaurant ty drives on ay! Resu lts:— > Customer is no longer hun fT 4 - Jey. TP Customer has less money. 2 Customer _is_happy | uohappy (option: > Customer is too full optional) Optional has > Customer

You might also like