clAsSate
Date
Page
Uait -4
4Knaualedge Represuntatibrn and Rekoning
Knouwladge Rupreantatian is responsible for epresenting
infarmatien about the real worlo So hot
Camputur
can wn derstound an utilie this knowledqe to solve
oamplexnal wortdprables.
Knouledge representation not just storing olata into
Some datoboLAet also enablea
intalligunt
an
machine to learn fom that knowleelge and xperienca
So that it behave inteligHy ike humon
Type of knauledge. -
Declarahve Proceolual
Knowlede Knowledge
KNOWLEDGE.
Stuchual Meta
Knauledge Kaawleclge
Heurishic
Knouwladga
1 Decdarative Knowledq
Declarative Knowleolge is to know about aoraething
inclucu concapts fa.cts ete.
4 also incluou olescriptive knowledge
# is express eolin oeclarahive sentences
St is simpler than pmeadural knawladlge..
Procedwrnl knowleda&
Jt js also known a im perahive krouledge
t is the type of krowuledge which invalves knowing
how to olo
SoMathing
H can be diectly applicd to any task
St inolude nuled, stategit, pnudurei, agurdai ete
Proeounl krawledge dapenda on the tauk on which
it can be opplied.
3. Meta kn owledge
Knowledg aboutother typeA of knowledga is caled
hasta knowledge
4. Heuristic knawlede
Hewriahe kna wldge represunts he knowleclye of
perts in a or Aubjc
Jt is based on previova xpeniuncea, awarnn of
approaahel and what Ore goodl to work, buk
not quaranteed
5.Shuchurad kno uwledq
J+ is he basic lanouledge for protblem- solving
St de cribes the relahonships betueen Cancepts ar
objects, Quch as "kind of",part of or grouping of
omesining
Technigues of Knowledge Represutation
There ae mainly 4
ways of knowledge npreientatian as
shewn
Knowlealge Representation
Techniquez
logical Semantic Procwetion Frame
Rapresuntathion Networks Rules Represuntation
Kogical Representation
Jt 1s a language with &onme concrete rule nd hat
ho ambiguity n epre Senta fion.
Cenclusion boua
ogical nepresentationmaan. olrawing
on Vaunous Con olihions.
ound seman ti
J4 consists of a precisely clefinad syntax
that support e Soundl infurence.
Each sentence con be trans lated into loqics using
Syatax and Semanho
S4 involy A therules
The noleA which by which we intupret
oleciole how We can the sentencesin the
Conituct legal sentencu logie ound asingning
no logic nd which meaning to each
Syma bals we
we can use in Sunteno
knoulclge reprelentaion.
Logical representation Qan be clasifed into 2 Jagic
Pro posihional logics
Preolicate logioA
doluantag of kagical Rapresuntation
Jt enables us to oo logical raioning
J+ js ha bouis far progroum
prngran ming Janguage.
* Disadvantagt of Logical Rapredentatian
St had Some reaicionA ,and can be ahallengin to work
with.
May not be vy natua, infernca may net be so
fiant.
Smanhc Networt Representation
Altenahve of predicate logic for knowlealge repruentahin.
Knawledg iS rprpreA ented in the form of graphical.
networks whure nedles reprsnt he abjects ound
aras epresent the relaienship bttween thaDse abjects.
Snantic networks easy to unolerstand and 0anbe
easily ex tenaled
Semantic representoatiùn has 2 type of rlahons mainy
"fs-a relabon inheritance)
kind-afrelahion
eq Statuments a. Teny is a cat
b. Jeny Ís amammal
CJemy iS ownadl by Priya
d. Jemy is white aolo ured
e mammals oe ounimas.
is -a
Cat Mammal
s-a
is-aloureol
Temy
Animal
White
IS-owned Priya (The statements have
been represented in the
fom of neces ound ara
above)
eaah objact is connected to ounother object by
rdathion
Advantagea of Semantio natuork
Thy ae a natral reprekentation of knowledge
The networks OUre simple and oasils Undtandable
They the meanirg in a transparnt manner
Draw backs of Qumanthe nutuork’
hgh camputational time s we heed totravese
the complete network trea to ans Wer Some qqueahora,
andin Orst ase acenano after toVsing the
enire te, we may ind hat the solution oloet not
exist in dhe netuork.
Thy ty to modal human - like memory but in
pache it is nat passible to builed QUoh vat Qemanic
These networks are nat intelligent thy olepend
the crratorthe system.
No stoundard oleinihan tor link namel
The epresentahion is inadequate s it dloeA not have
any quivalunt quanhferg for all'"r sonmnona't.
Frame Rapresentation
like Svchure that conists of a
collechion of slots ond alot valuet
The slots can have ouy type or si2e.
The Slots have names and valued oalleo facats
Facets oe the featrel f tha ganl
0an oontain any nwmber of slots and a alot
oan containony number offacts. Fncuts may kave any
humburo Valwes
val
fame is also nown slot-fter knouludge.
npruntatian. in atifcial intelig unce
fame system cansists af a collechian of fames which.
is cannuctud. Sn
gn afame the knowlecdge about an
object Dr event can be sdored tog ether in dhe knowledg e
base.
eg Enhihy PRtr
Peter is enginer 25 ylo, liva in kondon
England. ome nepraentoian for this is
Slots Filhr
Name Peter
Age
Profusian. Enginar
Cihy London
auntry Englardl
*ddrantage of Franma Raprcaentahan
34 makes
programming eouier by graupinq the related data
4 is
Veny cay to add alots
Jt S easy to un ustaund andvisUali 2e
Jt is campaurattvuly fexible and is used by many applia ho
-nA in AT. data cnat
t is easy to inclucle olefawt tobed Searoh aroh for missing
Valves
Disad vantagea of Frame Rapresentatian
Snfurno muchanism is not srngothly
Jt hala muoh genaralized appraach.
procesled
Produchon Rules
Prooluchon oles condist of Coondihion, achon) pair
which mean condihon then achon
t has mainly 2 poarts Set f produchion nulea
working memony
The ecognize- act cycle
Agant checks for the candihonifit exists then the
poduction nule Dund he Carsponding actian s
Camd out. his enhre pnass is callecd ecognize - aot
cyele
The working mamary storra dscniphion of the eunnt
State f problem solving. Rulea can wnte knouwlecge
into the wonteing memony and this knowloge may
matchand othor cule
An a nw aihuahion., mwlhiple nles may fire togehar andl
this is calleod es nfiot set. qunt must select orule
om dhe set in nis situahan, cund this is aoled'
orfict raolution.
TE_(at bust atop AND bus ouniv eu) THEN achion get
into the bus
IE (on he bus AND Paiol AND empty seot THEN
action ait oloun)
Poge
IE (on the bus AND unpaid) THEN aohion (pay charg)
IF bUS amve ot dAhnatian) THEN achon Cget_daun
fam bus)
*dntage of Proouhion RuleA
Expreued naral tanguage
Highly moowlar, So can easily be nmoved,adoled ar
Moolifed.
KDisadvantagek o Praoluatian Rules
No leaming Capabilihes, it doeA nat store the rsuld of
he prablm for future
During pngram excutionmany ules may be uctive, henca
ule -boued produchon ystens
stern s. an inaffoient.
