WEAK SLOT -AND FILLER -STRUCTURES Amey D.S.Kerkar, Asst.Professor, Computer Engineering Dept. Don Bosco College of Engineering, Fatorda-Goa.Inheritable knowledge * The relational knowledge base determines a set of attributes and associated values that together describe the objects of knowledge base. Ce John 180 Right 4 throws Sam 5.10 170 right_right Jack 6.2 215 Bats_throws E.g. Player_info(“john”,”6.1”,180,right_throws) * The knowledge about the objects, their attributes and their values need not be as simple as shown. * One of the most powerful form of inference mechanisms is property inheritance.* Property Inheritance * Here elements of specific classes inherit attributes and values from more general classes in which they are included. * In order to support property inheritance objects must be organized into classes and classes must be arranged in generalization hierarchy.Here, Lines ==attributes and boxed nodes== object/values of attributes of an object. person(Owen) = instance(Owen, Person) Mammal team(Owen, Liverpool) has-part ; a Instance Red —_\_ Owen Liverpool This structure Is also called as slot and filler structure. These structures are the devices to support property inheritance along isa and instance links.* Advantage of slot and filler structures: 1. monotonic reasoning can be performed more effectively than with pure logic and non monotonic reasoning is easily supported. 2. Makes it easy to describe properties of relations. e.g. “does Owen has-part called nose?” 3. Form of object oriented programming and has advantages such as modularity and ease of viewing by people.Slot and filler structures “ao™ Weak slot and filler structure Strong slot and filler structure Semantic nets Frames Conceptual Dependency Scripts Weak slot and filler structures: are “Knowledge- Poor” or “weak” as very little importance is given to the specific knowledge the structure should contain. Attribute= slot and its value= fillerSemantic nets * In semantic nets information is represented as: — set of nodes connected to each other by a set of labelled arcs. * Nodes represent: various objects / values of the attributes of object . * Arcs represent: relationships among nodes. Mammal isa has-part Person || Nose instance uniform cl team Blue SO Jack +IChicago Royals* In this network we could use inheritance to derive the additional info: has_part(jack, nose) Intersection Search One way to find relationships among objects is to spread the activation(links) out from two nodes and find out where it meets Ex: relation between : Mammal Red and liverpool isa t i has-part Person }—————*| Nose uniform instance color team Red * Owen + Liverpool* Representing non binary predicates: 1. Unary- e.x. Man(marcus) can be converted into: instance(marcus,Man) 2. Other arities- e.x. Score(india,australia,4-1) 3 or more place predicates can be converted to binary form as follows: 1. Create new object representing the entire predicate. 2. Introduce binary predicates to describe relation to this new object.Score(india,australia,4-1) Game Visiting _team Australia isa Score }e—_____] Home _team TEST4 IndiaEx. 2. “john gave the book to Mary” give(john,mary,book) instance instance beneficiaryMaking some important distinctions “john has height 72” height " “john is taller than Bil height height greater_than ValuePartitioned semantic nets * Used to represent quantified expressions in semantic nets. * One way to do this is to partition the semantic net into a hierarchical set of spaces each of which corresponds to the scope of one or more variable. ¢ “the dog bit the mail carrier” [partitioning not required] | see | Mall Carrer isa assailant victim : -—L* +—L: ]* “every dog has bitten a mail carrier” Vx: dog (x)> dy: mail-carrier(y) A bite(x, y) * How to represent universal quantifiers? — Let node ‘g’ stands for assertion given above — This node is an instance of a special class ‘GS’ of general statements about the world. — Every element in ‘GS’ has 2 attributes:- * Form - states relation that is being asserted. * V connections - one or more, one for each of the universally quantified variables. — ‘SA’ is the space of partitioned sementic net.* “every dog has bitten a mail carrier” Mail-Carrier¢ “Every dog in the town has bitten the constable” Constables assailant victim]* “Every dog in the town has bitten every constable” Dogs Bite Constables | SA r $1* More examples of sementic nets: « “Mary gave the green flowered vase to her favourite cousin” instance Colour_pattern Green flowered beneficiary cousin favourite* “every batsman hits a bal |” | Batsman SA* “Tweety is a kind of bird who can fly. It is Yellow in colour and has wings.” colour has-part [yellow Bird |?" Wings actioy instance fl Tweety y |* Represent following using sementic nets:- Tom is a cat. Tom caught a bird. Tom is owned by John. Tom is ginger in color. Cats like cream.The cat sat on the mat. Acat is a mammal. Abird is an animal. All mammals are animals.mammals have fur.Frames ¢ Another kind of week slot and filler structure. * Frame is a collection of attributes called as slots and associated values that describe some entity in the world (filler). * Consider, Room instance Location Hotel room| height contains contains Hotel Chair Hotel bed]Hotel Room —, isa : Room contains: Hotel Bed =—— Frame structure for Hotel Room contains: Hotel Chair Hotel Chair | isa: Chair = Frame structure for Hotel Chair use: sitting_on location: Hotel Room Lee eee —— Frame structure for all remaining attributes Frame System for Hotel RoomPerson isa: Mammal cardinality: 6,000,000,000 * Handed: right Adult_ Male isa: Person Cardinality: 2,000,000,000 * Height: 5- 10 ML _Baseball_Player isa: Adult_Male cardinality: 624 * height: 6-1 * bats: equal to handed * batting-avg: 0.252 *team: *uniform_color: Jack_Roberts = Fielder instance: Fielder height: 5-10 balls: right batting_avg: 0.309 team: Chicago cubs uniform_color: blue Individual frame isa: ML_Baseball_Player cardinality: 376 batting_avg: 0.262 ML_Baseball_Team isa: Team cardinality: 26 team_size: 24 manager:N Meta Class: special class whose elements themselves are classes. — If Xis meta class and Y is another class which is an element of X, then Y inherits all the attributes of X. Other ways of relating classes to each other Mutually disjoint: 2 classes are mutually disjoint if they are guaranteed to have no elements in common. Is covered by: relationship is called as ‘covered-by’ when we have a class and it has set of subclasses, the union of which is equal to the superclass. ML_Baseball_Player American Leaguer National Leaguer Fielder Pitcher Catcher instance instanceML_Baseball_Player is covered-by: { Pitcher, Catcher, Fielder,American leaguer, National leaguer} Pitcher isa: ML_Baseball_Player mutually_disjoint-with: (Catcher, Fielder } Catcher isa: ML_Baseball_Player mutually_disjoint-with: (Pitcher, Fielder } Fielder isa: ML_Baseball_Player mutually_disjoint-with: (Pitcher, Catcher}Tangled Hierarchies ¢ Hierarchies that are not trees * Usually hierarchy is an arbitrary directed acyclic graph. * Tangled hierarchies requires new property inheritance algorithm.isa Ostrich fly no. FIGURE A + Can fifi fly? * The correct answer must be ‘no’. — Although birds in general can fly, the subset of birds , ostriches does not. — Although class pet bird provides path from fifi to bird and thus to the answer that fifi can fly, it provides no info that conflicts with the special case knowledge associated with class ostrich, so it should hove no effect on the answer.Republican acifist: False instance instance FIGURE B + IsJack Pacifist? Ambiguity * One way to solve ambiguity is to base the new inheritance algo based on path length: Using BFS start with the frame for which slot value is needed. Follow its instance links, then follow isa links upwards If the path produces a value it can be terminated, as can all other paths once their length exceeds that of the successful path.* Using this technique our answers to fifi problem is :’no’ and for jack problem we get 2 values hence ‘contradiction’. * Now consider following hierarchies: FIGURE C isa Ostrich fl isa Plumed Ostrich White-Plumed Ostrich Pet-Bird js instance instance * Our new algo gives answer: fificanfly. i.e. Fly: yes.FIGURE D Republican pacifist: false Conservative Republican instance instance Jack Pacifist: 2 * Here our new algo reaches Quaker and deduces pacifist:true and stops without noticing further contradiction.* Solution to the problem is to base our algo not based on path length but on inferential distance. Sess * Class 1 is closer to class2 than class 3 if class has an inferential path through class2 to class3. * For figure A answer is no * For figure B >Contradiction PLEASE REFER PROPERTY INHERITANCE ALGO Rich and Knight pg. 204-205 34 edition.we ©