Hresitional Calcaulus; Some

tu a Sygtem hot deals vith Y: k is Humid

Hhe method used tor manibulaion e
Ahe
gmbols accoxding to Some vles. ) is humid -hen is hot,
ALPHABET SET
bi Set e Vanables ox TheCT)
tositional Smbols .o,R (2)
iü Logical Contants false (F)
(>X)
üüj Two Parentheses and ")1 ià hot (and) humid
iv) Set loaital eradors Y.
1M Lioord not sumbel. hartle hen &w not) yaining.
çj and XAY (XA)rz
iv) imlies (Xni} x then Y
(X+>)
wSet e eqivalerce yelaion sex lauws: (P,a,R) are Vañables.
G Qomuukalive laws: PAQ aAP, Pve avp
Associaive Lans: (Pna) nRE Pn(anR),(Pv)vR PVvR)
boutle Ngaton:(p) ?
bwDe- Morgan's law;r(ve)- rlhra, r(Al -pvra
Absoton law:
P=l
L Law a Contradition: PAP= fale P.oJ
Law o, exduded middle: PvrP-Tue
RuLES OF lNFERENCE:
bO MoDUS PoNE Ns: HPandP siven to be tue,-lben cwe Can
inter that 'o is tue.
P: t is aheoliday
csed
(D
]-> coe (an eythat it is tne
O' The School
O: b ]’
Po: t i 'u ahoiday, then School u cdosed
MoDos TOLLE NS: Ih no' and'Pore gien to be tne, then we
Can ider that ~p u tue
-Q. chool is not dosed.
heliday then Schod ià net dosed,
L 1t unet a
Suesi Dayine. Tautuleg and trth table. ATautology 'à ator mula votich ualuays
ruth Table Shows how the truth or-faity q aa tue, Lohbosib
L s Conhradi cion(oa
Cowbeund Statement dhends on -he truth or Shos that (e>0)v(a-p) tutolog
aliy Sinale staament,.
Some 4 Truth Table Eo T T T al art
P T T
T T T tne
T
statweat T T
AND: (PAQ)’Tne h P and a
both are tne. Ta]Paatompound
T
T
T T Statimen
F
 madels Nortd
Rebvesenting Sinle facb in FopL: termsctrDef;vùng a Serlene :
Real- word facts Can be reþresented as eAatouic Sentence is aSentence.
Lgcal froosi tions whten os well- lormed bis deined as bredicate
prmlas in pafositional bjc. Contant d aiy 'n, followed byt ,-b
yRetrntatior terms encdosed n barentheces and
Prhesties
Reation. Seporaked by Comnas.
Loi,'s s Sentente then rs s sentence.
Symbes art tprmed 4 be tolto uoing:
Set otSententes
s,s2 ar sIAs2 (oijuion)
Alfhab ebs.
Set 3 ]sVsa (d§yn ction)
-]sa (jlicakon)
3 UnderScore charactex. Sl=s2(cquivalence)
bmun] Cor't be
are bronun] witen ) ix Var. and s u Sentenee the
þredicaa
Aogic in botositonal loaje A su a Sentence .
a Sentence
Ouantifiers in Pedicae Calculu' for al ' '
0niversa sueh 4hat
Osedinin oriversal
There ar two uatifies osed
int- order þredicate Calaulusi Evistensial Borsome'
L Coastran the weaning Setence
Coutaining a Vañable
,Ouanificr is follone d by a Vaiale
and a Sentence.
Bke footbal.:Boyo)->like(a,ft
bal)
Some,eoys ike fot bal :Boyt Aikela, totu
 an exanhle. ALGORITHM:
Ques- Desxc inbe Urihicaion Algonthn voithidetial.
Urificaions meons making enbessi ons Jooks
can be done nith he process e Substitution . Abr A2 u Vañable Constant
eace oi tha) VL Al ond Az ae idotiad
40 and are idotical i Teun NIL

Ha,F(gtæ) asa( eblate uith L. Else i Al bruD in A2 veboy

Unticaion Cond: fail
OPredicake Synbel must be Same Subsi tui on Ls Else etun A2) A)
No, c atguments in bsth exþrssions Set check for A2 in Ag
ALLt be'idlica,} Same fail il A2 0c curo in A
-wo Siilar Vañ ables þresent in SanMe
eesion, hen Uihcaion fails.
Numei( s Coil
()Else SuBST NIL
LsoP
Rem SuesT.
 A2.
Ai

sihte (bly)
Subsitute ai Subst tuked uith b]

Unilied Successfully
Pime cun, riney)
Sulbsitute

Prime (u), Pisme c)

[)
 Ques;- Ditierentiaka betueen Forward
forward and
and Backtoord
Batkubard claangg ReaoiA
ForNaYd Rea soningt- lt wmoves fprward backword
Backward Reasoning' t moves Called as
Staut to goal State. Atso ealed as Data tom aod -to initial state. Also
Diven Reoaorng: doal Bien Rea sonng
b atSench Te
Free ha lnitial Cagurationts bbat-theot
Seonch
Search Tire has Goal Caniquration (9)
Tree has
ot e tree. a-e tree.
Next level o Tree generated Tree iàsgeneraked bg
Neat Level ,s Tree
all the rules enose - m4
side, ma al he ue hose nghk,
he roo t node If-THEN RuLES tinding
Side matches rot nodes.
[Medical Diagonsis] hiiay System is
th one
OGoal Stoat andrles
provided ae Seleed ushe
Con tai nt Gol Stat esides in THEN
Res are poat.
(Seosches fos each Cornstnt.L i c2>DI) Sleted Tules
Satiting wes (R.s) be comes LHS
 Why thus hopeneo!
ues- vhat is -he Sionificance e stece Eroine n
.

Erpevt Sytems? Disauss foroard chaining and L inding out Cauge/eason

backuoord chainng Stratgies. Cuet
ence Egthe acojaes admaipulate knulde
Bace -lo arive at þaticular
tOede ed
rulesAenerated (AND te RiME
Rule Based Enþot Sykem:
’A}lies Rules ebeatudly tto ack rm
ü Aad nem Kronledge o Rng vledge Base.
iüi Realve RJe csica.
Feraard cenina AND Dec1
Lyehat Can habben next? fact2 DR
 keproyenting cass Mentbesih and cas mcusion
in þedicake Lgc
Two þrediakeslsa and nstance are used,
Rebrsents Relationshiþ Rebreent class membenhi
closs inclusion Tloionshi . BIRD
Two foes < Penguin is a eivd, Two Gases,ENGUIN
Bigo ebjeck.
+4- aJ he atibutes 4, clas( enqun, Bivd) jse
Bixd are inhe nted
enguin das " Imatance( Pinge ongin) indanta.
Couhauison ce Proposi tion ond Predicat Cal culuy:
(FoL)
YREDICATE CALCULUS VRoposIT|ONAL CALCULOS
Predieates are used that uses rohosi tions in uohich Coblale
invelves Contants, Varabu, Scntent'e th denoted
relatibn funt^.
Can rebreent
Talll Amon)
(art neres ent indi vdual erdities
Aman is tall )
Can't engress qenerali zahor,
þaeYm.
Shecializai en bv
Seuore ha s SideS
 Qlues- Elain Mint Max theovem.(ane Plying Pabeies:- CoMPLETE
is a sheci ali zed Seonch Alc-o that etuns
otimal Seauence d moves found mamum
Xero SuM Qame. imal dat.
Recursive Backtvacking algo which ç wsed Time
in dedsion making andGale theory.>Two Phycr
uwes ecuson t Seanch deitameTee, ,Bachr
winj max
Copures minj wn ax deasie or Cussent ametne
a MAY [Slecb, marimymValue]
L THo Plye%MIN [Selecs ninimum Nabue] Liitaions:
Depth-Ant Search Ago is ued tox ebbraion L, slow tor Conle Games Such
Complede Game Tree. as che SS.
L CHESs, checken, Tie-tac-tbe
]Wont Values L 35 choi ces/nbes.
loo (fos bsth
(35)0 BIG.
 theoem;
man
man 2 (A
min

-. ma
2c)nin
2 5 6 man
3 L
-
(F )2 4(
hi tial Values mane-0
Lmin o -3 2 1 -3 4
-2,-0) -1

G-2,2)
 Towers oh Hanoi Pablem: Slution:
On One Jost here s Set o< ndisks 2 State
each with hele in he Center and o
dient sodi us de P2 P3
3 Iitial State
2 (4) Put 3' on
1

Tak is o move all 4 the disks to

|2
1 3
P
1
one other þost. (2) |121
Ouy ane disk Can be moed at
a tiwe. 3
L lasge dik Cart be þlaced on Smaller
P2
14 ' on ta
disk, (5) 3
2P2 3 2 1

(C)
P2
 Tc- TAc-Toe ProeLEM: Re-Kata Egle: litid Stat
Two-Playey Gome vehere one player
Called MAX Wauks a letler Xand the
ebponent Called MIN mauks a ter'o'
'3x3' Grhd vohere two playes hut
heis leters.
Playes ith Sane maks (three) in slatey
Coleke Row CoLUMN| DIAGO NAL wins
he Game
b Staat Stake =Embby Ghd.
aoal Stake. Win for either player MAA
latemed wiming
MAX MIN slates sate
(3 Conse cuti ve X) (3Conseuti ve o j