Abstract
Inheritance networks are not expressive enough to capture all intuitions behind inheritance. Hence, a number of significantly different semantics have been proposed. Here, a family of local theories of inheritance is presented that are conceptually simple and computationally tractable. A general model-theoretic framework for specifying direct semantics to networks and clarifying relationships among them is developed. It is also shown that the local constraints specifying the semantics are satisfiable when the attention is restricted to acyclic networks. The notion of local semantics is generalized to what is called ground local semantics to further understand the relationship between the local theories and the path-based theories of inheritance. A family of polynomial-time set-based inheritance algorithm 8 that conforms to these inheritance theories is also presented. © 1995 John Wiley & Sons, Inc.
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.
