Skip to main content

Expressive extensions to inheritance networks

  • Knowledge Representation
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 689))

Included in the following conference series:

  • 118 Accesses

Abstract

Even though much work has gone into explicating the semantics of inheritance networks, no consensus seems to have emerged among the researchers about their precise semantics. In fact, there are several different possible interpretations of the same network topology. So, from a practical knowledge representation standpoint, in the absence of any independently verifiable semantics, we wish to pursue the approach of enhancing the language of traditional inheritance networks to enable the user to choose among the various available options, to program in a more complete description of the input problem in the enriched language. This approach permits representation of certain networks that were not represent able previously, and allows making subtle distinctions among networks that were not hitherto possible. In this paper we propose an annotated inheritance network language, develop its formal semantics by amalgamating harmoniously a family of related “local” inheritance theories, and discuss some implementation issues.

This research was supported in part by the NSF grant IRI-9009587.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bacchus, A modest, but semantically well-founded, inheritance reasoner, In IJCAI-89, pp. 1104–1109, 1989.

    Google Scholar 

  2. N. Belnap, How a computer should think, in: G. Ryle (ed.), Contemporary Aspects of Philosophy (Oriel Press, 1977) 30–56.

    Google Scholar 

  3. H. Geffner, Defaults Reasoning: Causal and Conditional Theories, Ph.D. Dissertation, University of California at Los Angeles, 1989.

    Google Scholar 

  4. M. L. Ginsberg, A local formalization of inheritance: preliminary report, 1988.

    Google Scholar 

  5. J. Horty, R. Thomason, and D. Touretzky, A skeptical theory of inheritance in nonmonotonic semantic networks, Artificial Intelligence, 42 (1990) 311–348

    Google Scholar 

  6. J. Horty and R. Thomason, Mixing strict and defeasible inheritance, In AAAI-88, pp. 427–432, 1988.

    Google Scholar 

  7. T. Krishnaprasad, M. Kifer, and D. S. Warren, On the declarative semantics of inheritance networks, In IJCAI-89, pp. 1093–1098, 1989.

    Google Scholar 

  8. Krishnaprasad Thirunarayan, The semantics of inheritance networks, Ph.D. Dissertation, State University of New York at Stony Brook, 1989.

    Google Scholar 

  9. Krishnaprasad Thirunarayan, Implementation of an efficient inheritance reasoner, Technical Report WSU-04-91, Wright State University, 1991.

    Google Scholar 

  10. Krishnaprasad Thirunarayan and M. Kifer, A theory of nonmonotonic inheritance based on annotated logic, In Artificial Intelligence 60 (1993).

    Google Scholar 

  11. D. Makinson and K. Schlechta, Floating conclusions and zombie paths: two deep difficulties in the “directly skeptical” approach to defeasible inheritance nets, In Artificial Intelligence 48 (1991) 199–209.

    Google Scholar 

  12. E. Neufeld, Defaults and probabilities; extensions and coherence, In KR-87, pp. 312–323, 1989.

    Google Scholar 

  13. L. Padgham, Negative reasoning using inheritance, In IJCAI-89, pp. 1086–1092, 1989.

    Google Scholar 

  14. J. Pearl, Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann, 1988.

    Google Scholar 

  15. H. Przymusinska and M. Gelfond, Inheritance hierarchies and autoepistemic logic, University of Texas at El Paso, 1989.

    Google Scholar 

  16. B. Selman and H.J. Levesque, The tractability of path-based inheritance, In IJCAI-89, pp. 1140–1145, 1989.

    Google Scholar 

  17. L. A. Stein, A preference-based approach to inheritance, Brown University, 1990.

    Google Scholar 

  18. R. Thomason, J. Horty, and D. Touretzky, A calculus for inheritance in monotonic semantic nets, In ISMIS-87 pp. 280–287, 1987

    Google Scholar 

  19. R. Thomason and J. Horty, Logics for inheritance theory, In Non-Monotonic Reasoning, M. Reinfrank et al (eds.), 1989.

    Google Scholar 

  20. D. Touretzky, R. Thomason, and J. Horty, A skeptic's menagerie: conflictors, preemptors, reinstaters, and zombies in nonmonotonic inheritance, In IJCAI-91, pp. 478–483, 1991.

    Google Scholar 

  21. D. Touretzky, The mathematics of inheritance systems, Morgan Kaufmann, 1986.

    Google Scholar 

  22. D. Touretzky, J. Horty, and R. Thomason, A clash of intuitions: the current state of nonmonotonic multiple inheritance systems, In IJCAI-87, pp. 476–482, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jan Komorowski Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thirunarayan, K. (1993). Expressive extensions to inheritance networks. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56804-9

  • Online ISBN: 978-3-540-47750-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics