Abstract
This paper describes a new approach to inheritance reasoning in semantic networks allowing for multiple inheritance with exceptions. The approach leads to an analysis of defeasible inheritance which is both well-defined and intuitively attractive: it yields unambiguous results applied to any acyclic semantic network, and the results conform to our intuitions in those cases in which the intuitions themselves are firm and unambiguous. Since the definition provided here is based on an alternative, skeptical view of inheritance reasoning, however, it does not always agree with previous definitions when it is applied to nets about which our intuitions are unsettled, or in which different reasoning strategies could naturally be expected to yield distinct results. After exploring certain features of the definition presented here, we describe also a hybrid (parallel-serial) algorithm that implements the definition in a parallel marker-passing architecture.
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.
