Skip to main content
SpringerLink
Log in

A parametric definition for a family of inheritance reasoners

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper gives a declarative specification of a popular inheritance system and shows how simple changes to this specification can result in different path-based reasoners. This parameterized definition provides a deeper understanding of the fundamental differences between some of the more popular path-based inheritance reasoners. In particular, it allows the clarification of some of the results on the complexity of reasoning in the various systems. The uniform framework also allows definition of novel systems which constitute intermediate points in the space of possible reasoners, and facilitates perspicuous Prolog implementation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Al-Asady, R. and Narayanan, A., “More Notes on ‘A Clash of Intuitions’,” inProceedings of the 13th International Joint Conference on Artificial Intelligence, Chambery, France, pp. 682–87, 1993.

  2. Boutilier, C., “A Semantical Approach to Stable Inheritance Reasoning,” inProceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, pp. 1134–1139, 1989.

  3. Cripps, A., “Aspects of the Inheritance Problem,”MSc thesis, Department of Computer Science, University of Victoria, 1987.

  4. Delgrande, J., “An Approach to Default Reasoning Based on a First-Order Conditional Logic: Revised Report,”Artificial Intelligence, 36, 1, pp. 63–90, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  5. Delgrande, J., “A Semantics for a Class of Inheritance Networks,” inProceedings of the 8th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Ottawa, Ontario, 1990.

  6. Geffner, H. and Verma, T., “Inheritance=Chaining+Defeat,” inCSD-890039, Computer Science Department, University of California, Los Angeles, 1989.

    Google Scholar 

  7. Hewson, C. and Vogel, C., “Psychological Evidence for Assumptions of Path-Based Inheritance Reasoning,” inProceedings of the Sixteenth Annual Conference of the Cognitive Science Society, Atlanta, Georgia, pp. 409–414, 1994.

  8. Horty, J., Thomason, R., and Touretzky, D., “A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks,”Artificial Intelligence, 42, 2–3, pp. 311–348, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  9. Kautz, H. A. and Selman, B., “Hard Problems for Simple Default Logics,”Artificial Intelligence, 49, pp. 243–279, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. Maugham, S.,The Moon and Sixpence, London: Pan Books Ltd. Pan Edition, 1974.

    Google Scholar 

  11. McDermott, D. and Doyle, J., “Non-Monotonic Logic I,”Artificial Intelligence, 13, 1–2, pp. 41–72, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  12. Niemelä, I. and Rintanen, J., “On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning,”Journal of Applied Non-Classical Logics, 4, 2, pp. 141–179, 1994.

    MATH  MathSciNet  Google Scholar 

  13. Reiter, R. and Criscuolo, G., “Some Representational Issues in Default Reasoning,”Computers and Mathematics with Applications, 9, 1, pp. 15–27, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  14. Sandewall, E., “Nonmonotonic Inference Rules for Multiple Inheritance with Exceptions,”Proceedings of IEEE, 74, 10, pp. 1345–1353, 1986.

    Article  Google Scholar 

  15. Selman, B. and Levesque, H., “The Tractability of Path-Based Inheritance,” inProceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, pp. 102–109, 1989.

  16. Selman, B. and Levesque, H., “The Complexity of Path-Based Defeasible Inheritance,”Artificial Intelligence, 62, pp. 303–339, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  17. Stein, L. A., “Skeptical Inheritance: Computing the Intersection of credulous Extensions,” inProceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, pp. 1153–1160, 1989.

  18. Touretzky, D.,The Mathematics of Inheritance Systems, Los Altos, CA: Morgan Kaufman, 1986.

    MATH  Google Scholar 

  19. Touretzky, D., Horty, J., and Thomason, R., “A Clash of Intuitions: The Current State of Non-Monotonic Inheritance Systems,” inProceedings of the 10th International Joint Conference on Artificial Intelligence, Milan, Italy, pp. 476–482, 1987.

  20. Veltman, F., “Defaults in Update Semantics,” unpublished manuscript, Institute for Language, Logic and Information, University of Amsterdam, 1994.

  21. Vogel, C., Popowich, F., and Cercone, N., “Logic-Based Inheritance Reasoning,” inProceedings of the 9th Bi-Annual Conference of the Society for the Study of Artificial Intelligence and the Simulation of Behavior, AISB’93, Birmingham, England, March 29-April 2, pp. 179–188, 1993. Appears inProspects for Artificial Intelligence (A. Sloman, et al., eds.), Amsterdam: IOS Press, 1993.

  22. Vogel, C. M., “Defining Psychologically Plausible Default Inheritance Reasoners,” unpublished manuscript, Institute for Computational Linguistics, University of Stuttgart, 1995.

  23. Vogel, C. M., “Inheritance Reasoning: Psychological Plausibility, Proof Theory and Semantics,”Ph.D. thesis, Centre for Cognitive Science, University of Edinburgh, 1995.

  24. Vogel, C. M., “A Generalizable Semantics for Inheritance Reasoning,” to appear in theCSLI Lecture Notes Volume, The 1st Tbilisi Symposium on Logic, Language and Computation, 1996.

  25. Vogel, C. M., “Human Reasoning with Negative Defaults,” appears inPractical Reasoning (Dor Gabbay and Hans Jürgen Ohlbach eds.),Lecture Notes in Artificial Intelligence 1085, Berlin: Springer-Verlag, pp. 606–621, 1996.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computational Linguistics, University of Stuttgart, Azenbergstr. 12, D-70174, Stuttgart, Germany

    Carl Vogel

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, British Columbia, Canada

    Fred Popowich

Authors
  1. Carl Vogel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fred Popowich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work reported here is primarily the research of Carl Vogel, with Fred Popowich being particularly involved with the initial logical specification and implementation. Thanks to Nick Cercone, who collaborated with the authors on earlier research relating to the material presented in this paper, and also to two anonymous reviewers for constructive suggestions. Vogel is particularly grateful to Robin Cooper and Jeff Pelletier for feedback and encouragement as well as to the Marshall Aid Commemoration Commission for making it possible for him to do his Ph. D. at the Centre for Cognitive Science in Edinburgh. Popowich wishes to acknowledge the support of the Natural Sciences and Engineering Research Council of Canada.

Carl Vogel, Ph.D.: He is a Research Scientist in the Institute for Computational Linguistics at the University of Stuttgart. He is grateful to the Sonderforshungsbereich 340 for funding his postdoctoral work there. Vogel finished his Ph.D. in Cognitive Science at the University of Edinburgh in 1995. He is interested in the proof theory and semantics of default reasoning as well as consequent applications throughout computational linguistics: semantics of natural language generics, robust processing of natural language in typed feature systems, and syntactic representation.

Fred Popowich, Ph.D.: He is an Associate Professor of Computing Science and an Associate Member of the Department of Linguistics at Simon Fraser University. He received his Ph.D. in Cognitive Science/ Artificial Intelligence from the University of Edinburgh in 1989. His current research interests include the development and processing of unification based grammars, machine translation, natural language interfaces to databases, the structure of the lexicon, the use of inheritance in the lexicon, and the use of lexical resources in natural language processing applications.

About this article

Cite this article

Vogel, C., Popowich, F. A parametric definition for a family of inheritance reasoners. New Gener Comput 15, 247–291 (1997). https://doi.org/10.1007/BF03037948

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037948

Keywords

Search

Navigation