Scribd
Upload
51 views13 pages

Resolution Method: Presented By: Gunjan Chhabra

The document discusses the resolution method for theorem proving. It introduces resolution as a technique that builds refutation proofs by proving contradictions. Resolution uses an inference rule to perform deductive reasoning on propositional and first-order predicate logic. It yields a complete inference algorithm when coupled with a complete search method. Resolution operates on a knowledge base of facts to derive the empty clause, showing a goal is true by refuting its negation. Steps involve converting statements to CNF, negating the goal, and applying resolution to derive contradictions. Two examples demonstrate applying resolution to knowledge bases to prove goals.

Uploaded by

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

Resolution Method: Presented By: Gunjan Chhabra

The document discusses the resolution method for theorem proving. It introduces resolution as a technique that builds refutation proofs by proving contradictions. Resolution uses an inference rule to perform deductive reasoning on propositional and first-order predicate logic. It yields a complete inference algorithm when coupled with a complete search method. Resolution operates on a knowledge base of facts to derive the empty clause, showing a goal is true by refuting its negation. Steps involve converting statements to CNF, negating the goal, and applying resolution to derive contradictions. Two examples demonstrate applying resolution to knowledge bases to prove goals.

Uploaded by

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

Resolution Method

Presented by:
Gunjan Chhabra
Resolution
• Resolution is a theorem proving technique that proceeds by building
refutation proofs, i.e., proofs by contradictions. It was invented by a
Mathematician John Alan Robinson in the year 1965.
• Resolution method is an inference rule which is used in both
Propositional as well as First-order Predicate Logic in different ways.
• Resolution yields a complete inference algorithm when coupled with
any complete search algorithm.
• Resolution makes use of the inference rules. Resolution performs
deductive inference.
• 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.
Proof by Refutation
• The key idea for the resolution method is to use the knowledge base and negated
goal to obtain null clause(which indicates contradiction). Resolution method is
also called Proof by Refutation.
• Since the knowledge base itself is consistent, the contradiction must be
introduced by a negated goal. As a result, we have to conclude that the original
goal is true.
• Then the resolution rule is applied to the resulting clauses. Each clause that
contains complementary literals is resolved to produce a two new clause, which
can be added to the set of facts (if it is not already present).This process continues
until one of the two things happen:
• There are no new clauses that can be added
• An application of the resolution rule derives the empty clause
• An empty clause shows that the negation of the conclusion is a complete
contradiction ,hence the negation of the conclusion is invalid or false or the
assertion is completely valid or true.
Steps for Resolution:
1. Conversion of facts into first-order logic.
2. Convert FOL statements into CNF
3. Negate the statement which needs to prove (proof by contradiction)
4. Draw resolution graph (unification).
Steps for CNF:
1. Eliminate  and <-> if available.
2. Move ‘negation symbol inside
3. Rename Variables or standardize variables
4. Eliminate existential instantiation quantifier by elimination. This process
is known as Skolemization.
5. Drop Universal Quantifier.
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.
Example
Example

Step-3: Negate the statement to be proved

written as ¬likes(John, Peanuts)


Draw Resolution graph:
Explanation

•In the first step of resolution graph, ¬likes(John, Peanuts) , and likes(John, x) get resolved(canceled) by
substitution of {Peanuts/x}, and we are left with ¬ food(Peanuts)

•In the second step of the resolution graph, ¬ food(Peanuts) , and food(z) get resolved (canceled) by
substitution of { Peanuts/z}, and we are left with ¬ eats(y, Peanuts) V killed(y)

•In the third step of the resolution graph, ¬ eats(y, Peanuts) and eats (Anil, Peanuts) get resolved by
substitution {Anil/y}, and we are left with Killed(Anil)

•In the fourth step of the resolution graph, Killed(Anil) and ¬ killed(k) get resolve by substitution {Anil/k},
and we are left with ¬ alive(Anil)

•In the last step of the resolution graph ¬ alive(Anil) and alive(Anil) get resolved.
Example 2
Example 2
Example 2
CNF rules
• Eliminate -> and <-> Skelomization:
• a-> b = ~a ˅ b ∃x Rich(x) = Rich (G)
• a<->b = a->b ˄ b->a
• Move ~ inwards
• ~ (∀x P (x))= ∃x ~P(x)
• ~ (∃x P(x))= ∀x ~P(x)
• ~(a ˅ b) = ~a ˄ ~b
• ~ (a ˄ b) = ~ a ˅ ~b
• ~(~a) = a

You might also like