Skip to main content

Inheritance Theory and Path-Based Reasoning: An Introduction

  • Chapter
Knowledge Representation and Defeasible Reasoning

Part of the book series: Studies in Cognitive Systems ((COGS,volume 5))

  • 169 Accesses

Abstract

The term “semantic networks” points to a variety of graph-based formalisms that are widely used for the representation of knowledge in computational systems. These network formalisms were introduced in this computational context by Quillian (see [Quillian67]), who used them to model human associative memory and hierarchical or taxonomic reasoning.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Bibliography

  • Brachman, R., R. Fikes, and H. Levesque. Krypton: a functional approach to knowledge representation. FLAIR Technical Report #16, Fairchild Laboratory for Artificial Intelligence Research 1983.

    Google Scholar 

  • Brachman, R. “I lied about the trees,” The AI Magazine 6, 1985.

    Google Scholar 

  • Brachman, R. and H. Levesque, eds. Readings in Knowledge Representation, Morgan Kaufmann, 1985.

    MATH  Google Scholar 

  • Carlson, G. “Generic terms and generic sentences,” Journal of Philosophical Logic 11, 1982.

    Google Scholar 

  • Cross, C. and R. Thomason. “Update and conditionals,” Methodologies for Intelligent Systems, (Proceedings of The Second International Symposium on Methodologies for Intelligent Systems), Z. Ras and M. Zemankova, eds., Elsevier, 1987.

    Google Scholar 

  • Ellis, B. Rational Belief Systems, Rowman and Littlefield, 1979.

    Google Scholar 

  • Fahiman, S. NETL: A System for Representing and Using Real-world Knowledge, MIT Press, 1979.

    Google Scholar 

  • Gärdenfors, P. “Belief revision and the Ramsey test for conditionals,” Philosophical Review 95, 1986.

    Google Scholar 

  • Garey, M. and D. Johnson. Computers and Intractability, Freeman, 1979.

    MATH  Google Scholar 

  • Horty, J. “Some Direct Theories of Nonmonotonic Inheritance,” Technical Report, School of Computer Science, Carnegie Mellon University, forthcoming.

    Google Scholar 

  • Horty, J. and R. Thomason. “Mixing Strict and Defeasible Inference,” Proceedings of AAAI-88, Morgan Kaufman, 1988.

    Google Scholar 

  • Horty, J. “A Defeasible Logic Based on Inheritance Theory,” Technical Report, School of Computer Science, Carnegie Mellon University, forthcoming.

    Google Scholar 

  • Horty, J., R. Thomason, and D. Touretzky. Touretzky. “A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks. Technical Report CMU-CS-87–175, Computer Science Department, Carnegie Mellon University 1987. An abbreviated version appears in Proceedings of AAAI-87, Morgan Kaufmann, 1987.

    Google Scholar 

  • Krifka, M. “An outline of genericity,” Technical Report. Seminar für Natürlich-sprachliche Systeme, Biesingerstr. 10, 7400 Tübingen, W. Germany, 1987.

    Google Scholar 

  • Krifka, M., ed. “Genericity in natural language: Proceedings of The 1988 Tübingen conference,” Seminar für Natürlich-sprachliche Systeme, 7400 Tübingen, W. Germany, 1988.

    Google Scholar 

  • Levesque, H. and R. Brachman. “A fundamental tradeoff in knowledge representation and reasoning,” Readings in Knowledge Representation, R. Brachman and H. Levesque, eds., Morgan Kaufmann, 1985.

    Google Scholar 

  • McCarthy, J. “Artificial intelligence, logic and formalizing common sense,” Logic and Artificial Intelligence, R. Thomason, ed., Kluwer, 1989.

    Google Scholar 

  • McGee, V. “A counterexample to modus ponens,” Journal of Philosophy 82, 1985.

    Google Scholar 

  • Minsky, M. “A framework for representing knowledge,” MIT Artificial Intelligence Laboratory Memo #306 1974. Reprinted without appendix in The Psychology of Computer Vision, P. Winston ed., McGraw-Hill, 1975.

    Google Scholar 

  • Pelletier, J. and L. Schubert. “Problems in the representation of the logical form of generics, bare plurals, and mass terms,” New Directions in Semantics, E. LePore, ed., Academic Press, 1987.

    Google Scholar 

  • Quillian, M. “Word concepts: a theory and simulation of some basic semantic capabilities,” Behavioral Science 12, 1967.

    Google Scholar 

  • Sandewall, E. “Non-monotonic inference rules for multiple inheritance with exceptions,” Proceedings of The IEEE 74, 1986.

    Google Scholar 

  • Sowa, J. Conceptual Structures: Information Processing in Mind and Machine, Addison-Wesley, 1984.

    MATH  Google Scholar 

  • Stalnaker, R. “A theory of conditionals,” Studies in Logical Theory, N. Rescher, ed., Blackwell, 1968.

    Google Scholar 

  • Thomason, R., and J. Horty. “Logics for nonmonotonic inheritance,” Non-Monotonic Reasoning (Proceedings of the Second INternational Workshop on Non-Monotonic Reasoning), M. Reinfrank, J. de Kleer, M. Ginsberg, and E. Sandewall, eds., Springer Verlag, 1989

    Google Scholar 

  • Thomason, R., J. Horty, and D. Touretzky. “A calculus for inheritance in monotonic semantic nets,” Technical Report CMU-CS-86138, Computer Science Department, Carnegie Mellon University 1986.

    Google Scholar 

  • Thomason, R. and D. Touretzky. “An Inheritance Path Formulation of Roles and Relations,” Proceedings of The Catalina Conference on Formal Aspects of Semantic Networks,J. Sowa, ed., forthcoming.

    Google Scholar 

  • Thomason, R. and J. Aronis. “Hybridizing nonmonotonic inheritance with theorem proving,” Unpublished manuscript, 1988. To appear as a Carnegie Mellon University Technical Report.

    Google Scholar 

  • Touretzky, D. The Mathematics of Inheritance Systems, Morgan Kaufmann, 1986.

    MATH  Google Scholar 

  • Touretzky, D., J. Horty, and R. Thomason. “A clash of intuitions: the current state of nonmonotonic multiple inheritance systems,” Proceedings of IJCAI-87, Morgan Kaufmann, 1987.

    Google Scholar 

  • Woods, W. “What’s in a link: foundations for semantic networks,” Representation and Understanding: Studies in Cognitive Science, D. Bobrow and A. Collins, Academic Press, 1975.

    Google Scholar 

  • Wos, L., R. Overbeck, E. Lusk, and J. Boyle. Automated Reasoning, Prentice-Hall, 1984.

    MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Carpenter, B., Thomason, R. (1990). Inheritance Theory and Path-Based Reasoning: An Introduction. In: Kyburg, H.E., Loui, R.P., Carlson, G.N. (eds) Knowledge Representation and Defeasible Reasoning. Studies in Cognitive Systems, vol 5. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0553-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0553-5_13

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6736-2

  • Online ISBN: 978-94-009-0553-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics