Lexical Knowledge Structures

Semantics : Rewrite rule (contd)
Given
r, r 1 , r 2 ∈ R, where
r, r 1 ≠ type, and
r, r 2 ≠ subRelationOf
x, y, c, c 1 , c 2 ∈ I ∪ C ∪ R, where
c, c 2 ≠ atr
Then,
{(r 1 , subRelationOf, r 2 ), (x, r 1 , y)} ↩→ (x, r 2 , y)
E.g.# : {(motherOf , subRelationOf, parentOf),
(Kunti , motherOf, Arjun)} ↩→
(Kunti , parentOf, Arjun)
{(r, type, atr), (x, r, y), (y, r, z)} ↩→ (x, r, z)
E.g1. #
{(NonNegInteger, subClassOf, Integer),
(Integer, subClassOf, Number)} ↩→
So : (NonNegInteger, subClassOf, Number)
A K Nirala
Lexical Knowledge Structures