Scribd
Upload
20 views13 pages

Resolution Unit 3 New l5

Uploaded by

aayushigarg9927
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
20 views13 pages

Resolution Unit 3 New l5

Uploaded by

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

RESOLUTION

• Resolution is a theorem proving technique that


proceeds by building refutation proofs, i.e.,
proofs by contradictions.
• Resolution is used, if there are various
statements are given, and we need to prove a
conclusion of those statements.
• Unification is a key concept in proofs by
resolutions.
• Resolution is a single inference rule which can
efficiently operate on the conjunctive normal
form or clausal form.
• Clause: Disjunction of literals (an atomic
sentence) is called a clause. It is also known as
a unit clause.
• Conjunctive Normal Form: A sentence
represented as a conjunction of clauses is said
to be conjunctive normal form or CNF.
Steps for Resolution:

• Conversion of facts into first-order logic.


• Convert FOL statements into CNF
• Negate the statement which needs to prove (proof by
contradiction)
• Draw resolution graph (unification).
Example:
• John likes all kind of food.
• Apple and vegetable are food
• Anything anyone eats and not killed is food.
• Anil eats peanuts and still alive
• Harry eats everything that Anil eats.
Prove by resolution that:
• John likes peanuts.
Step-1: Conversion of Facts into FOL

• John likes all kind of food.


• Apple and vegetable are food
• Anything anyone eats and not
killed is food.
• Anil eats peanuts and still alive
• Harry eats everything that Anil
eats.
Prove by resolution that:
• John likes peanuts
Step-2: Conversion of FOL into CNF
In First order logic resolution, it is required to convert the FOL into CNF as
CNF form makes easier for resolution proofs.
• Eliminate existential
instantiation quantifier
by elimination.
In this step, we will
eliminate existential
quantifier ∃, and this
process is known
as Skolemization. But in
this example problem
since there is no
existential quantifier so
all the statements will
remain same in this step.
•Drop Universal quantifiers Step-3: Negate the statement to be proved

• In this statement, we will


apply negation to the
conclusion statements,
which will be written as
¬likes(John, Peanuts)
•
Step-4: Draw Resolution graph:
EXAMPLE 2
• Part(I) : English Sentences
• If it is sunny and warm day you will enjoy.
• If it is raining you will get wet.
• It is warm day
• It is raining
• It is sunny
• If it is sunny and warm • Part(II) : Propositional
day you will enjoy. Statements
• If it is raining you will • Enjoy ← sunny ∧ warm
get wet. • wet ← raining
• It is warm day • Warm
• It is raining • Raining
• It is sunny • sunny
• (~sunny∨~warm) ∧ enjoy
• (~strawberry_picking ∨~raining)
• (~raining ∨ wet )
• (warm)
• (raining)
• (sunny)

You might also like