Scribd
Upload
8 views15 pages

Resolution

The document discusses the resolution theorem proving technique, which was invented by John Alan Robinson in 1965 and operates on conjunctive normal form (CNF). It outlines the steps for resolution, including converting facts into first-order logic (FOL), transforming FOL into CNF, negating the statement to be proved, and drawing a resolution graph. An example is provided to illustrate the process of proving a conclusion through resolution.

Uploaded by

slwcnt77
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
8 views15 pages

Resolution

The document discusses the resolution theorem proving technique, which was invented by John Alan Robinson in 1965 and operates on conjunctive normal form (CNF). It outlines the steps for resolution, including converting facts into first-order logic (FOL), transforming FOL into CNF, negating the statement to be proved, and drawing a resolution graph. An example is provided to illustrate the process of proving a conclusion through resolution.

Uploaded by

slwcnt77
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/ 15

RESOLUTION IN FOL

BY D R. TA N U J A K . S A R O D E
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 is used, if 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.
RESOLUTION
• 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).
STEPS FOR RESOLUTION:
• 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".
STEPS FOR
RESOLUTION:
• Step-1: Conversion of
Facts into FOL
• In the first step we will
convert all the given
statements into its first
order logic.
STEPS FOR RESOLUTION:
• 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 all implication (→) and rewrite
1.∀x ¬ food(x) V likes(John, x)
2.food(Apple) Λ food(vegetables)
3.∀x ∀y ¬ [eats(x, y) Λ ¬ killed(x)] V food(y)
4.eats (Anil, Peanuts) Λ alive(Anil)
5.∀x ¬ eats(Anil, x) V eats(Harry, x)
6.∀x¬ [¬ killed(x) ] V alive(x)
7.∀x ¬ alive(x) V ¬ killed(x)
8.likes(John, Peanuts)
STEPS FOR RESOLUTION:
• Step-2: Conversion of FOL into CNF (contd....)
• Move negation (¬)inwards and rewrite
• ∀x ¬ food(x) V likes(John, x)
• food(Apple) Λ food(vegetables)
• ∀x ∀y ¬ eats(x, y) V killed(x) V food(y)
• eats (Anil, Peanuts) Λ alive(Anil)
• ∀x ¬ eats(Anil, x) V eats(Harry, x)
• ∀x killed(x) V alive(x)
• ∀x ¬ alive(x) V ¬ killed(x)
• likes(John, Peanuts).
STEPS FOR RESOLUTION:
• Step-2: Conversion of FOL into CNF (contd....)
• Rename variables or standardize variables
• ∀x ¬ food(x) V likes(John, x)
• food(Apple) Λ food(vegetables)
• ∀y ∀z ¬ eats(y, z) V killed(y) V food(z)
• eats (Anil, Peanuts) Λ alive(Anil)
• ∀w¬ eats(Anil, w) V eats(Harry, w)
• ∀g killed(g) V alive(g)
• ∀k ¬ alive(k) V ¬ killed(k)
• likes(John, Peanuts).
STEPS FOR RESOLUTION:
• Step-2: Conversion of FOL into CNF (contd....)
• 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.
STEPS FOR RESOLUTION:
• Step-2: Conversion of FOL into CNF (contd....)
• Drop Universal quantifiers.
In this step we will drop all universal quantifier since all the statements are
not implicitly quantified so we don't need it.
• ¬ food(x) V likes(John, x)
• food(Apple)
• food(vegetables)
• ¬ eats(y, z) V killed(y) V food(z)
• eats (Anil, Peanuts)
• alive(Anil)
• ¬ eats(Anil, w) V eats(Harry, w)
• killed(g) V alive(g)
• ¬ alive(k) V ¬ killed(k)
• likes(John, Peanuts).
STEPS FOR RESOLUTION:
• Step-2: Conversion of FOL into CNF (contd....)
• Distribute conjunction ∧ over disjunction ¬.
This step will not make any change in this problem.
STEPS FOR RESOLUTION:
• 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)
STEPS FOR
RESOLUTION:
1. ¬ food(x) V likes(John, x)
2. food(Apple)
3. food(vegetables)
4. ¬ eats(y, z) V killed(y) V food(z)
5. eats (Anil, Peanuts)
6. alive(Anil)
7. ¬ eats(Anil, w) V eats(Harry, w)
8. killed(g) V alive(g)
9. ¬ alive(k) V ¬ killed(k)
10. likes(John, Peanuts) (To Prove)
STEPS FOR
RESOLUTION:
• Step-4: Draw Resolution
graph:
• Now in this step, we will solve
the problem by resolution tree
using substitution. For the
above problem, it will be
given as follows:

You might also like