Scribd
Upload
42 views

MUJ Slides For Knowledge Representation

1. The document lists 17 logical rules and principles including idempotent, commutative, associative, distributive, De Morgan's, implication elimination, contrapositive, double negation, modus ponens, modus tollens, and AND/OR introduction and elimination rules. 2. It provides examples of how to use these rules to transform logical statements by eliminating implications and biconditionals, applying De Morgan's laws, and reducing statements to normal forms using distribution and other laws. 3. The purpose is to define common logical rules and transformations that allow reasoning about the relationships between logical statements.

Uploaded by

Parthraj Solanki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views

MUJ Slides For Knowledge Representation

1. The document lists 17 logical rules and principles including idempotent, commutative, associative, distributive, De Morgan's, implication elimination, contrapositive, double negation, modus ponens, modus tollens, and AND/OR introduction and elimination rules. 2. It provides examples of how to use these rules to transform logical statements by eliminating implications and biconditionals, applying De Morgan's laws, and reducing statements to normal forms using distribution and other laws. 3. The purpose is to define common logical rules and transformations that allow reasoning about the relationships between logical statements.

Uploaded by

Parthraj Solanki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 81

1.

Idempotent rule:
P P ==> P
P P ==> P
2. Commutative rule:
P Q ==> Q P
P Q ==> Q P
3.Associative rule:
P Q R) ==> (P Q) R
P (Q R) ==> (P Q) R
. Distributive Rule:
P (Q R) ==> (P Q) (P R)
P (Q R) ==> (P Q) (P R)

5. De-Morgan s Rule:
(P Q) ==> P Q
(P Q) ==> P Q
6. Implication elimination:
P Q => P Q
7. Bidirectional Implication elimination:
(P Q ) ==> ( P Q ) (Q P)
8. Contrapositive rule:
P Q => P Q
9. Double Negation rule:
( P) => P
Absorption Rule:
P ( P Q) => P
P ( P Q) => P
11.Fundamental identities:
P p => F [contradiction]
P P => T [Tautology]

P T => P
P F => P
P T => P

P F => F
P T => P
12. Modus Ponens:
If P is true and P Q then we can infer Q is also true.
P
P Q
__________
Hence, Q

13. Modus Tollens:


If P is true and P Q then we can infer Q.
P
P Q
__________
Hence, Q
14. Chain rule:
If p q and q r then p r

15. Disjunctive Syllogism:


if p and we can infer q is true.

16. AND elimination:


Given P and Q are true then we can deduce P and Q
seperately: P P
P Q
17. AND introduction:
Given P and Q are true then we deduce P

18. OR introduction:
Given P and Q are true then we can deduce P and Q
separately:
P P Q
Q P Q
Where disjunctions are:
1. Eliminate implications and biconditionals using formulas:
(P Q ) ==> ( P Q ) (Q P)
P Q =>

2. Apply De-Morgan s Law and reduce NOT symbols so as to bring negations


before the atoms. Use:
(P Q) ==> P Q
(P Q) ==> Q

3. Use distributive and other laws & equivalent formulas to obtain Normal forms.
P )

Q)

Q)
R]

R] [
hate (marcus , caesar)

x2 / marcus

x1 / marcus
(2)

You might also like