Topic: Logical Representation Course: Artificial Intelligence
Artificial Intelligence
UNIT-3
Logical Representation
Slide No. 1
Topic: Logical Representation Course: Artificial Intelligence
Logic
It is the science or study of valid arguments.
An argument consist of some premises(set of formulas) and conclusion.
Logic can be defined as the proof or validation behind any reason
provided.
It was important to include logic in artificial Intelligence because we
want our agent(System) to think and act humanly, and for doing so, it
should be capable of taking any decision based on the current situation.
While taking any decision ,the agent must provide specific reasons
based on which the decision was taken.
This reasoning can be done by the agent only. If he agent has the
capability of understanding the logic.
Department of IT Slide No. 5
Topic Logical Representation Course: Artificial Intelligence
Logical Representation
It is a language with some concrete rules which deals with propositions
and has no ambiguity(confusion) in representation.
Logical Representation classified into 2 types
[Link] logic
2. predicate logic or First order predicate logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
In propositional logic there are 5 Symbols to create the syntax to
represent the connection of Two or more sentences.
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
wet
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
properties of operators or Laws of operators
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: propositional logic Course: Artificial Intelligence
Propositional logic
Department of IT Slide No. 5
Topic: Axiomatic system Course: Artificial Intelligence
Department of IT Slide No. 5
Topic: Axiomatic system Course: Artificial Intelligence
Department of IT Slide No. 5
Topic: Axiomatic system Course: Artificial Intelligence
Department of IT Slide No. 5
Naluro Beouclon sm
Re oula 89 Compla l b Bonall
I 9% a ctnd f mo Cedaulu in hich logica
Recko 9 i e e d by inteuna Rule
cloxly
cloxly elalad lo a aiol uay of acojonng
w o oraonw )Lnrocducing
) eltont unolng
O(:A) A - Am Thn A A Az - -
- An
2f A, A2..An ahe iTUR Thun AA A2 A An ig
-
-
alo rue
(E:A) f A A AzA- - An tun Ai (sisn)
a Tru Than A alo 1ve
Tf A A AzA- . -
An
A: s i s n ) Thun VAzV
- .
An
3 (v) f a
-
iR Tua Thun 4v Az V .An ig
f any A; (1sis n)
alko
E:V) A VAz V An thun A Cistgn)
Noc
s e f forwoulok Kowun o xeumiBe )
Anotthul to vrble unouwn a Councluson ( y)
36,02 F as equuu
, alW ale Tha mookilFow onl
Cf a Tra, than
wewe Caun wr
(N)
CCLUn ay naN
hun we
ia Tru und
Tvu
(Ae)
nines on ofA
PAG
PAa,R GAR
PAG
2. R
3 G AF 1
. GARR AI 3,2
EK Ruuy fo doulsa Negalon.
E P, ( 9A7) - vpAY
olo uw
P reni
V(9AY) emi
3 NP
vv£ 2
9AY
PAr) AL 3,5
ulay
=
ormpliey AF
G, R R s xue thun
Ne Coun ayRB
E = R also
P, P-9, P>9>3) FY
emi&
P-9 memi
9 1,2
59 E 3
E 4,5
Aniwdua Arnpf
and ue
stod with ay ahumpFon
1f we
R Ccu
tuaed p , Thaur
P9 e mi
2 aMumplfou)
3 MT1, 2
> i2,3
P - ( 9 ) ,P, ~ E9
.P9>) r e mi
Pemi
e 12
M. 43
E
e ni A
aP ALA UONFo
3 i 2
MT 3
4 9
5 P ~v9
Ruw for Dkancion
u Thun R that
(aun say Tha
F
OV ako xu
Vi Vi v
Vi2
ounsd whia EualualFung
Vpis TruL
i s we haachad X aund
uathu d X that meau X Y o
we
V9 X x Ve X rue)
*u aNecalcon
om the lauw of CounlTadiclon nN falae
F 1s (as/uoplion) but
fal trun
P9 emi 6 e 5
umi vP 3-6S
3.P aumpFou)
4. 9 e ,3
5 e 213
oneol:o) o7
iunclFou )
rew
Au mnon
29
3 9VP Vi,2
AUmno
V4
Ve 1,4-5,2-3
P ANumton
Aup o
e 213
9 le4
3,5
D->9
P-9 Ve 1, 2-4, 25
