Ch07 Knowledge Repr Modified
Ch07 Knowledge Repr Modified
1
Chapter Objectives
2
“Shortcomings” of logic
• Emphasis on truth-preserving operations rather
than the nature of human reasoning (or natural
language understanding)
• if-then relationships do not always reflect how
humans would see it:
X (cardinal (X) red(X))
4
Semantic network developed by Collins
and Quillian (Harmon and King 1985)
5
Meanings of words (concepts)
6
Three planes representing three
definitions of the word “plant” (Quillian 1967)
7
Intersection path between “cry” and
“comfort” (Quillian 1967)
8
“Case” oriented representation schemes
10
Conceptual Dependency Theory
11
Basic idea
12
Basic idea (cont’d)
13
“John hit the cat.”
o
john PROPEL cat
14
Conceptual dependency theory
15
Conceptual dependency theory (cont’d)
Primitive acts:
• ATRANS transfer a relationship (give)
• PTRANS transfer of physical location of an object (go)
• PROPEL apply physical force to an object (push)
• MOVE move body part by owner (kick)
• GRASP grab an object by an actor (grasp)
• INGEST ingest an object by an animal (eat)
• EXPEL expel from an animal’s body (cry)
• MTRANS transfer mental information (tell)
• MBUILD mentally make new information (decide)
• CONC conceptualize or think about an idea (think)
• SPEAK produce sound (say)
• ATTEND focus sense organ (listen)
16
Basic conceptual dependencies
17
Examples with the basic conceptual
dependencies
18
Examples with the basic conceptual
dependencies (cont’d)
19
CD is a decompositional approach
o John
John <> *ATRANS* book
Pat
20
CD is a decompositional approach
o Pat
John <> *ATRANS* book
John
21
Ontology
22
“John ate the egg.”
23
“John prevented Mary from giving a
book to Bill”
24
Representing Picture Aiders (PAs) or states
25
More PA examples
26
Scales
27
Scales (cont’d)
Height (X+1)
John < Ξ
Height (X)
28
Variations on the story of the poor cat
29
Variations on the cat story (cont’d)
30
Variations on the cat story (cont’d)
Health(-2)
cat <
31
Causals
Pain( > X)
Jane <
Pain (X)
32
Causals (cont’d)
Pain( > X)
Jane <
Pain (X)
33
How about?
34
“John killed Jane.”
Health(-10)
Jane <
Health(> -10)
35
“John frightened Jane.”
Fear (> X)
Jane <
Fear (X)
36
“John likes ice cream.”
o
John <> *INGEST* IceCream
<
Joy ( > X)
John <
Joy ( X )
37
Comments on CD theory
38
Comments on CD theory (cont’d)
39
Understanding stories about restaurants
40
Restaurant stories (cont’d)
41
Restaurant stories (cont’d)
42
Restaurant stories (cont’d)
43
Scripts
44
A RESTAURANT script
Script: RESTAURANT
Track: coffee shop
Props: Tables, Menu, F = food,
Check, Money
Roles: S= Customer
W = Waiter
C = Cook
M = Cashier
O = Owner
45
A RESTAURANT script (cont’d)
46
A RESTAURANT script (cont’d)
47
A RESTAURANT script (cont’d)
48
A RESTAURANT script (cont’d)
49
Frames
50
Part of a frame description of a hotel
room
51
Conceptual graphs
52
Conceptual relations of different arities
Flies
is a bird flies
unary
relation
Color
is a dog color brown
binary
relation
Parents father
is a child parents
ternary
relation mother
53
“Mary gave John the book.”
54
Conceptual graphs involving a brown dog
Conceptual graph indicating that the dog named emma dog is brown:
55
Conceptual graph of a person with three
names
56
“The dog scratches its ear with its paw.”
57
The type hierarchy
58
A lattice of subtypes, supertypes, the
universal type, and the absurd type
w
r v
s u
59
Four graph operations
60
Restriction
61
Join
62
Simplify
63
Inheritance in conceptual graphs
64
“Tom believes that Jane likes pizza.”
object
proposition
pizza object
65
“There are no pink dogs.”
66
Translate into English
instrument
part hand
67
Translate into English
1
person between place attr hard
2
rock
68
Translate into English
69
Algorithm to convert a conceptual graph, g,
to a predicate calculus expression
1. Assign a unique variable, x1, x2, …, xn, to each one of
the n generic concepts in g.
2. Assign a unique constant to each individual constant
in g. This constant may simply be the name or marker
used to indicate the referent of the concept.
3. Represent each concept by a unary predicate with the
same name as the type of that node and whose argument
is the variable or constant given that node.
4. Represent each n-ary conceptual relation in g as an n-
ary predicate whose name is the same as the relation. Let
each argument of the predicate be the variable or
constant assigned to the corresponding concept node
linked to that relation.
5. Take the conjunction of all the atomic sentences
formed under 3 and 4. This is the body of the predicate
calculus expression. All the variables in the expression
are existentially quantified. 70
Example conversion
1. Assign variables
to generic concepts X1
2. Assign constants
to individual concepts emma
3. Represent each
concept node dog(emma) brown(X1)
4. Represent each
n-ary relation color(emma, X1)
5. Take the conjunction
all the predicates from
3 and 4 dog(emma) color(emma, X1) brown(X1)
All the variables are
existentially
quantified. X1 dog(emma) color(emma, X1) brown(X71
1)
Universal quantification
A cat is on a mat.
cat on mat
Cat: on mat
72