ONIT3

pooportio ionol ugic (PL)

At 1s 0 with Synwbolk
System thout deals with
sed for MaW pulation o CCOYding to o m e
gules
Statt mcnt declarative as
Each in PL AS
TRUe Or FALSE

docsn' t
erclama toy
>PL 8uppo ts , Opinions,
Statements.
ftomiC Sentin ce
1 applicable fo Single stattment O
Single symbot
Compound | Coruplex Sntene
s COnstTucteol witth Simple Sentences
t
Asimg logt'cal Connect1wrs
EXamp :0
9f 1t
1t 1s humvicl then it will aain
aatn.
9f
valicl Cqument
COnve1 this nto
P: 9t 1s humic
P- 6
t t ains

3 t 1s humid

JE 1 hot

ft alnin
hot anod huiCC Uhen
3 fti t 1s ABt

mo atnnl
i) 9f it 1s humid 1hun it tS hot
 to b wastag
Mse of Tutb Table poves Cume tnto
methods

So s0me
time. pvin
the
hetps in
Pictune whtch
tue
be
validity to
Methocds
Natural Deduction ystom

Tom
17tm AAB
AnB
decucted
ACBVc)
PoOVe

Formula De8coipl i0n

Rule

Hypothes's hA(BvC)
HPothi $1s AAB
(E A) eliminate

Ra A
eA) elimuinate
R
(I:V) Introduce
BVC C
(4 R3
ha(BVC) :A) aPPy
5) R tntoduCe on

(2) &)

PooVC (A>B )1 (B> C) ->(A>C)

emantic Tablcau stem:

C o n t r i c tio
construct eo
whrch
w hrch ttU
tre
1s a binaoy
t ules
with ta bleau

Rulcs
fules
Rule Tablecu Toee
avD

Rulc (s tuc beth

B
Loue
oAB

Rule 2
(dAp3)

dVP
Rulc 3

C&Vp)
Rule 4

n C K )

Ruule 5
B 1S toue
then

toue
1S
Rule 66
RuleY (oP) (N VB)
AB

Rule $ ap) Y(nvp)

Rule 9 (dAB)A n(avg

(B)

NAAB
(aAp) A AN)
(d Vp)A~(NEvB))
V) (aVB)
nsTVC thoat
patve
(A AnB)A (~BC) is
satis fict ble solutro.

Descipiion
int NO
Tableau 20ot AAB) A (6--C)
Rulei
(hANB) n (~B->C)

AAB 1)
3
BC -2

Rulel ( (A ANB)(~6c) 3

hn~B

nB-sC

A
5
nB

[N6C)
( A ~B)
n
Ruleb(31)

b C

0pen
Rule 5 (6)
ctose d
) COn stn uct tableau t e for the
the
fo uula (AAB) (B-.) and
DrUVe t fs lnsatis fiable

Dexciption AAP ToCC ine No

Tabl &au AMB)(Brt)
Rule A8) n (6- A)

B A

Rultl () A

Rule6 (3) B A 6
Closed cLosed
A
Rtlsts)
said to be wilh
Uilh
ta ble au
table au
Satfsfia ble
f
ts
Solution
Contraolt dory, then
S
fs mot
he 00t an d
1s 1eading to open Path
t
3atis ia bli
be umatisfiable if
ts saic to
Solution
t Contradictoay,
i t h 0Dt A
tableau path
1S tcadtng to Gpeh
tt tt
Lhen Close
and Unsatisjable
Resolutio
ton&Reputctt iom mcthccd
One fom pavpot fonal 1oqic
of o'r goal
uhr'ch s Used Lo povePonmula
proue
r
Pom given sct of clauset by applymg
COnta CL dtCttO9n
S p c c i a l - f o r m u l a

9othing but a
claute
Clatse
boolear) opera tors
centanung the
Valid
Vh
Show thcut o B V N(AB)
ineNo
Tablcau Trec
RuteNo
BN CA B)V r
n (By(B) yh)
R4 C1)

BVrCATB))

tAB)

A)

int No
Tableau TTee
Rule No
(BV h >6)YNA)

Ru C1)

n (rh B) V ~A)
Ry3)of nA 6)

(t)

6
Rulk5 (5
AB
Rulk 5 (4)
H
Rule 6 (4) X
X
Resolution o clauses
be Tsolvecd while
Two
Two tlauses can
Pai'n f titerak
elfmenabing
et'me'nating complementary
claetses is
esolvement ef a
Er:ind the
CVnB
O
$et AVB, hVB,

AV B NAV DD CVB
(h COntrodrction

BD
6B) contradictton

CVD
Cvesolved)
V B , AV D CN AB, NC ,wD
A-VB nAvD

BVD CVNB

NC

X (unTesoved)

uio nmatic bystem ;

mor
t 1s u'nmal 1 tructure but

pOvv cful than NDS

1S
1s C1mly eling
on three C3)
31
CAKIDYmns and1ol Lduct0n ule (mp-modus
poone)
 4tws
this 9Stem, we aly en OperatoT te

fxi0m1:

(p )
Axiom 2

(B Y) --(opj--(d1
Axiom3
( d NB) (P )
(nu
COmequ
deducte to
gEstablizh >C

A78, B Ct
int No
delemiption /fomuda
Rule
Thcore m

A-6
Hypothsis

Hypothe sic 2
BC
B--C)(h-(B-)
nstanct of
riOm-

BC)
MPC9)3)
Gnstanct Of
Axiom- 2 (A 6 ) 6 c )
-56)A)
MP(4 5) paDVCO
A C

rMP6)