Page 123 - DCAP506_ARTIFICIAL_INTELLIGENCE

Unit 9: Weak Slot and Filler Structures

Partitioned Networks Partitioned Semantic Networks permit for: Notes
 Propositions to be made without assurance to truth.
 Expressions to be measured.

Did u know? Basic idea: Break network into spaces which comprise groups of nodes and arcs and
consider each space as a node.
Consider the following: Symon thinks that the earth is flat. We can predetermine the proposition
the earth is flat in a space and inside it have nodes and arcs to symbolize the fact (Figure 9.7).
We can the have nodes and arcs to relate this space the rest of the network to signify Symon’s
belief.

Figure 9.7: Partitioned Network

Now consider the measured expression: Every parent loves their child To symbolize this we:

 Produce a general statement, GS, special class.
 Make node g an instance of GS.
 Every element contains at least 2 attributes:

 a form that specifies which relation is being emphasized.
 one or more forall (  ) or exists () connections — these symbolize universally
quantifiable variables in such statements e.g. x, y in  x: parent(x) y:child(y) 
loves(x,y)
Now we have to create two spaces one for each x,y.

Notes We can articulate variables as existentially qualified variables and articulate the event
of love having an agent p and receiver b for each parent p which could abridge the network.
Also If we modify the sentence to Every parent loves child then the node of the object being acted
on (the child) occurs outside the form of the common statement. Thus it is not observed as an

LOVELY PROFESSIONAL UNIVERSITY 117