Lab 11

Instructor: Saqib Daud

 Conversion of FOL to CNF
Steps:

• Eliminate Implication
• Standardize Variable
• Skolemization
• Drop Universal quantifier
 Why conversion is performed
• Because FOL are complicated and its difficult
for machine to understand it .

• So a need arise to convert FOL to CNF so that

the machine can easily understand the
knowledge
Eliminate Implication
Standardize Variable
Move Negation Inwards
 Skolemization
• Remove Existential quantifier and replace it by
Skolem Constant
Drop Universal quantifier
 Resolution Method

• Resolution uses proof by contradiction.

• One can perform Resolution from a
Knowledge Base.
• A Knowledge Base is a collection of facts or
one can even call it a database with all facts
 Example
All people who are graduating are happy
All happy people smile
Someone is graduating
Prove that is someone is smiling using resolution

• Convert to FOL
• Convert to FOL to CNF
• Prove that is someone is smiling using resolution
• Draw Resolution tree
Conversion of sentences into FOL
 Conversion of FOL into CNF
• Eliminate Implication
• Standardize Variable apart
• Move negation Inwards
 Skolemization
(existential quantifier remove and existential variable change into skolmn constant)
Drop Universal quantifier

Now these are the rules for Knowledge base for machine
 Resolution Tree
• If the fact ‘F’ is to be proved it starts with
negation of the F

• It contradicts all the other rules in KB

• The process stops when it returns null clause.