Abstract
This chapter reduces the frames to simple nodes that appear in inheritance networks and expressed by a figure and as a part of discussion it also treats objectlike concepts like Elephant, and properties, like Gray, equivalently as nodes. The simple form of inheritance is the kind used in description logics and other systems based on classical logic named strict inheritance. In a strict inheritance network, conclusions are produced by the complete transitive closures of all paths in the network. Any traversal procedure for computing the transitive closure is expected to do for determining the supported conclusions. In a tree-structured strict inheritance network, inheritance is very simple. In a strict inheritance network that is a directed acyclic graph (DAG), the results are the same as for trees. Inheritance in directed acyclic networks is often called multiple inheritance when a node has more than one parent node; in such cases, because of the meaning of the edges, the node must inherit from all of its parents.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
