Skip to main content

Formalizing pertinence links in inheritance reasoning: Preliminary report

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Uncertainty (ECSQARU 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 548))

  • 122 Accesses

Abstract

Pertinence links in inheritance networks allow one to assert the relevance or the irrelevance of an inheritance link with respect to a given concept. Although pertinence links were included in some of the earliest knowledge-representation formalisms like NETL, they have been omitted in more recent formal accounts of path-based inheritance reasoning. In this paper, we formalize and interpret pertinence links in the context of the important family of upward path-based inheritance reasoners.

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. D.W. Etherington, Reasoning with Incomplete Information, Research Notes in Artificial Intelligence, Pitman, London, 1988.

    Google Scholar 

  2. S.E. Fahlman, NETL: a system for representing and using real-world knowledge, MIT Press, 1979.

    Google Scholar 

  3. C. Froidevaux, Taxonomic default theory, Proc. ECAI-86, Pitman, London, pp. 123–129, 1986.

    Google Scholar 

  4. E. Grégoire, Skeptical theories of inheritance and nonmonotonic logics, in: Z.W. Ras (ed.), Methodologies for Intelligent Systems 4, North Holland, pp. 430–438, 1989.

    Google Scholar 

  5. E. Grégoire, Logiques non monotones et intelligence artificielle, Hermès, Paris, 1990.

    Google Scholar 

  6. E. Grégoire, Skeptical inheritance can be more expressive, in: Aiello L.C. (ed.), Proc. ECAI-90, Pitman, London, pp. 326–332, 1990.

    Google Scholar 

  7. E. Grégoire, About the logical interpretation of inheritance hierarchies, Proc. IPMU-90, pp. 281–283, 1990.

    Google Scholar 

  8. J.F. Horty, R.H. Thomason and D.S. Touretzky, A skeptical theory of inheritance in nonmonotonic semantic networks, Artificial Intelligence, vol. 42, pp. 311–348, 1990.

    Google Scholar 

  9. J.F. Horty and R.H. Thomason, Mixing strict and defeasible inheritance, Proc. AAAI-88, pp. 427–432, 1988.

    Google Scholar 

  10. D. Makinson and K. Schlechta, Floating conclusions and zombie paths: two deep difficulties in the directly skeptical approach to defeasible inheritance nets, Artificial Intelligence, vol. 48, pp. 199–209, 1991.

    Google Scholar 

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

    Google Scholar 

  12. L.A. Stein, Skeptical inheritance: computing the intersection of credulous extensions, Proc. IJCAI-89, pp. 1153–1158, 1989.

    Google Scholar 

  13. D.S. Touretzky, The Mathematics of Inheritance Systems, Morgan Kaufmann, Los Altos, 1986.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudolf Kruse Pierre Siegel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grégoire, E. (1991). Formalizing pertinence links in inheritance reasoning: Preliminary report. In: Kruse, R., Siegel, P. (eds) Symbolic and Quantitative Approaches to Uncertainty. ECSQARU 1991. Lecture Notes in Computer Science, vol 548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54659-6_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-54659-6_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54659-7

  • Online ISBN: 978-3-540-46426-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics