Scribd
Upload
42 views16 pages

Unification

Resolution is a logical inference technique for determining logical consequences from a set of premises. It works by attempting to derive a contradiction from the negation of the desired conclusion together with the premises. Resolution involves converting statements to clause form and applying the resolution rule to resolve clauses containing complementary literals until either the empty clause or no more clauses can be derived. Unification is used to determine if two literals can be made identical through variable substitution, allowing resolution to be applied. An example uses resolution to prove from given premises that "Gita likes almond" by negating the conclusion, converting to clause form, and resolving clauses until a contradiction is derived.

Uploaded by

C. SANTHOSH KUMAR
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
42 views16 pages

Unification

Resolution is a logical inference technique for determining logical consequences from a set of premises. It works by attempting to derive a contradiction from the negation of the desired conclusion together with the premises. Resolution involves converting statements to clause form and applying the resolution rule to resolve clauses containing complementary literals until either the empty clause or no more clauses can be derived. Unification is used to determine if two literals can be made identical through variable substitution, allowing resolution to be applied. An example uses resolution to prove from given premises that "Gita likes almond" by negating the conclusion, converting to clause form, and resolving clauses until a contradiction is derived.

Uploaded by

C. SANTHOSH KUMAR
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/ 16

UNIFICATION

AND
RESOLUTION
IN
FIRST ORDER LOGIC
Resolution

Resolution yields a complete inference algorithm when


coupled with any complete search algorithm.Resolution
makes use of the inference rules. Resolution performs
deductive inference.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.
Resolution Algorithm:

Resolution basically works by using the principle of proof by


contradiction. To find the conclusion we should negate the
conclusion. 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 Refutation

1    1. Convert all the propositions of KB to clause form


(S).
2. Negate a and convert it to clause form. Add it to S.
3. Repeat until either a contradiction is found or no
progress can
be made:
Unification
In propositional logic it is easy to determine that
two literals can not both be true at the same time.
Simply look for L and ~L . In predicate logic, this
matching process is more complicated, since
bindings of variables must be considered.
For example man (john) and man(john) is a
contradiction while man (john) and man(Himalayas)
is not. Thus in order to determine contradictions we
need a matching procedure that compares two
literals and discovers whether there exist a set of
substitutions that makes them identical . There is a
recursive procedure that does this matching . It is
called Unification algorithm.
In Unification algorithm each literal is represented as a list,
where first element is the name of a predicate and the
remaining elements are arguments. The argument may be a
single element (atom) or may be another list. For example
we can have literals as
The Unification algorithm is listed below as a procedure UNIFY
(L1, L2). It returns a list representing the composition of the
substitutions that were performed during the match. An empty
list NIL indicates that a match was found without any
substitutions. If the list contains a single value F, it indicates
that the unification procedure failed.
Example of FOPL resolution
Consider the following knowledge base:
Gita likes all kinds of food.
Mango and chapati are food.
Gita eats almond and is still alive.
Anything eaten by anyone and is still alive is food.
Goal: Gita likes almond.
Solution: Convert the given sentences into FOPL as:

Let, x be the light sleeper.


∀x: food(x) → likes(Gita,x)
food(Mango),food(chapati)
∀x∀y: eats(x,y) Ʌ ¬ killed(x → food(y)
eats(Gita, almonds) Ʌ alive(Gita)
∀x: ¬killed(x) → alive(x)
∀x: alive(x) →  ¬killed(x)
Goal: likes(Gita, almond)
Negated goal: ¬likes(Gita, almond)
Now, rewrite in CNF form:
¬food(x) V likes(Gita, x)
food(Mango),food(chapati)
¬eats(x,y) V killed(x) V food(y)
eats(Gita, almonds), alive(Gita)
killed(x) V alive(x)
¬alive(x) V ¬killed(x)
Hence, we have achieved the given goal with the help of
Proof by Contradiction. Thus, it is proved that Gita likes
almond.
PROBLEM 1:
PROBLEM 2:

You might also like