ok

1. KNOWLEDGE REPRESENTATION
&
PREDICATE LOGIC

13. Issues in Knowledge Representation
1. Important Attributes:
Any attribute of objects so basic that they occur in
almost every problem domain?
There are two attributes “instance” and “isa”, that are
general significance. These attributes are important
because they support property inheritance.

14. 2. Relationship among attributes
1. Inverse — This is about consistency check, while a value is added to one
attribute. The entities are related to each other in many different ways.
2. Existence in an isa hierarchy — This is about generalization-specification,
like, classes of objects and specialized subsets of those classes, there are
attributes and specialization of attributes. For example, the attribute
height is a specialization of general attribute physical-size which is, in
turn, a specialization of physical-attribute. These generalization-
specialization relationships are important for attributes because they
support inheritance.
3. Technique for reasoning about values — This is about reasoning values of
attributes not given explicitly. Several kinds of information are used in
reasoning, like, height: must be in a unit of length, Age: of a person cannot
be greater than the age of person’s parents. The values are often specified
when a knowledge base is created.
4. Single valued attributes — This is about a specific attribute that is
guaranteed to take a unique value. For example, a baseball player can at
time have only a single height and be a member of only one team. KR
systems take different approaches to provide support for single valued
attributes.

15. 3. Choosing Granularity:
 At what level of detail should the knowledge be represented?
Regardless of the KR formalism, it is necessary to know:
 At what level should the knowledge be represented and what
are the primitives?
 Should there be a small number or should there be a large
number of low-level primitives or High-level facts.
 High-level facts may not be adequate for inference while Low-
level primitives may require a lot of storage.

16. 4. Finding Right structure:
Given a large amount of knowledge stored in a database, how can
relevant parts are accessed when they are needed?
 This is about access to right structure for describing a particular
situation.
 This requires, selecting an initial structure and then revising the
choice.
While doing so, it is necessary to solve following problems:
 How to perform an initial selection of the most appropriate
structure.
 How to fill in appropriate details from the current situations.
 How to find a better structure if the one chosen initially turns
out not to be appropriate.
 What to do if none of the available structures is appropriate.
 When to create and remember a new structure.

17. Knowledge Representation
Methods
 Logic
 Production Rules
 Semantic Nets
 Frames

18. Knowledge representation
What is Logic?
• Logic: the set of patterns used to carry out reasoning.
• Pattern: a template or a set of rules found as a result of
observing commonalities.
• Reasoning: is the act of using reason.
• Reason: ability of the human mind to form concepts or
knowledge and operate on symbols or language.

19. Types of Logic
Theories of Logic What Exists Belief of Agents
Propositional Logic Facts T/F/Unknown
First Order
Predicate Logic
or simply
Predicate Logic
Facts, objects,
relations
T/F/Unknown
Temporal Logic Facts, object,
Relations, Times
T/F/Unknown
Probability theory Facts Degree of belief
[0…..1]
Fuzzy Logic Degree of truth Degree of belief
[0…..1]

26. Predicate Logic
• Logic which is concerned not only with sentential
connectives but also with the internal structure
of atomic propositions is usually called a
predicate logic.
• Two common quantifiers are the existential  and
universal  quantifiers.

27. First Order Predicate Logic
• First-order predicate logic (like natural language) assumes
the world contains:
– Objects: people, houses, numbers,
colors, baseball games, wars, …
– Relations: prime, brother of, bigger
than, part of, comes between, …
– Functions: father of, best friend,
one more than, plus, …

28. Syntax of FOPL: Basic elements
• Constants a, b, c, Ram, 2, ...
• Predicates P, Q, R, EQUAL, ...
• Functions Sqrt, f, g, h, father-of, …
• Variables x, y, z, ...
• Connectives (Not), (Implies),
(And(conjuction)),
(Or(disjunction)),
(Double implies)
• Equality =
• Quantifiers , 

29. Inference Rules
• Inference rules provide the means to perform logical proofs or deduction.
• Modus Ponens: From P and P Q infer Q.
• For example:
Given: (Joe is a father)
And: (Joe is a father)  (Joe has a child)
Conclude: (Joe has a child)
 Chain Rule:
From P  Q and Q  R, infer P  R
P  Q
Q  R
P  R


P
P Q
Q

30. Horn clauses
 A literal is an atomic formula or its negation.
 A clause is a disjunction of literals.
 A Horn clause is a clause with exactly one
positive literal
 A Horn formula is a conjunctive normal form
formula whose clauses are all Horn

31. Example
Prolog:
Horn formula:
 c:- a, b.
 a.
 b.
 [c  ¬a  ¬b]  a  b
 [c,¬a, ¬ b] [a] [b]

36. Examples Predicate Logic
1. Marcus was a man.
man(Marcus)
2. Marcus was a Pompeian.
Pompeian(Marcus)
3. All Pompeians were Romans.
x: Pompeian(x)  Roman(x)
4. Caesar was a ruler.
ruler(Caesar)
5. All Romans were either loyal to Caesar or hated him.
x: Roman(x)  loyalto(x, Caesar)  hate(x, Caesar)

41. 6. Every one is loyal to someone.
x: y: loyalto(x, y) y: x: loyalto(x, y)
7. People only try to assassinate rulers they are not loyal to.
x: y: person(x)  ruler(y)  tryassassinate(x, y)
 loyalto(x, y)
8. Marcus tried to assassinate Caesar.
tryassassinate(Marcus, Caesar)

42. A Predicate Logic Example
1. Marcus was a man. man(Marcus)
2. Marcus was a Pompeian. Pompeian(Marcus)
3. All Pompeians were Romans. x: Pompeian(x)Roman(x)
4. Caesar was a ruler. ruler(Caesar)
5. All Romans were either loyal to Caesar or hated him.
x: Roman(x)  loyalto(x, Caesar) V hate(x,Caesar)
6. Everyone is loyal to someone. x: y: loyalto(x,y)
7. People only try to assassinate rulers they aren't loyal to.
x:y:person(x) ruler(y)  tryassassinate(x,y) loyalto(x,y)
8. Marcus tried to assassinate Caesar.
tryassassinate(Marcus, Caesar)
9. All men are people. x: man(x)  person(x)

43. Normal Forms in Propositional and Predicate Logic

49. Conversion to
Clause Form:Example
 Example:
x: [Roman(x)  know(x, Marcus)] [hate(x,Caesar) V (y: z: hate(y,z) 
thinkcrazy(x,y))]
– Eliminate 
x: [Roman(x)  know(x, Marcus)] V [hate(x,Caesar) V (y: z:
 hate(y,z) V thinkcrazy(x,y))]
– Reduce the scope of each  to a single term.
x: [ Roman(x) V  know(x, Marcus)] V [hate(x,Caesar) V (y: z: hate(y,z) V
thinkcrazy(x,y))]
– Standardize variables so that each quantifier binds a unique variable:
x: P(x) V x: Q(x) converts to x: P(x) V y: Q(y)
x: Roman(x) V x:  know(x, Marcus) V
x: hate(x,Caesar) V (y: z: hate(y,z) V x: y: thinkcrazy(x,y))

50. Conversion to
Clause Form:Example
– Move quantifiers.
x: y: z: [Roman(x) V  know(x, Marcus)] V [hate(x,Caesar) V (hate(y,z) V
thinkcrazy(x,y))]
– Eliminate existential quantifiers.
y: President(y) will be converted to President(S1)
x: y: father-of(y,x) will be converted to
x: father-of(S2(x),x))
Here, there are no existential quantifiers.
– Drop the prefix.
[ Roman(x) V  know(x,Marcus)] V [hate(x, Caesar) V ( hate(y,z) V thinkcrazy(x,y))]
– Convert to a conjunction of disjuncts.
 Roman(x) V  know(x,Marcus) V hate(x,Caesar) V 
hate(y,z) V thinkcrazy(x,y)

55. Example
a) John likes all kind of food.
b) Apple and vegetable are food
c) Anything anyone eats and not killed is food.
d) Anil eats peanuts and still alive
e) Harry eats everything that Anil eats.
Prove by resolution that:
f) John likes peanuts.

56. Step-1: Conversion of Facts into FOL

57. Step-2: Conversion of FOL into CNF

62. Step-4: Draw Resolution graph:

63. Explanation of Resolution graph
• First step: ¬likes(John, Peanuts) , and likes(John, x) get
resolved(canceled) by substitution of {Peanuts/x}, and we
are left with ¬ food(Peanuts)
• Second step: ¬ food(Peanuts) , and food(z) get resolved
(canceled) by substitution of { Peanuts/z}, and we are left
with¬ eats(y, Peanuts) V killed(y) .
• Third step: ¬ eats(y, Peanuts) and eats (Anil, Peanuts) get
resolved by substitution {Anil/y}, and we are left with
Killed(Anil).
• Fourth step: Killed(Anil) and ¬ killed(k) get resolve by
substitution {Anil/k}, and we are left with ¬ alive(Anil) .
• Last step:¬ alive(Anil) and alive(Anil) get resolve