Skip to main content Accessibility help
×
Home

Research developments in multiple inheritance with exceptions

  • Peter W. Eklund (a1)

Abstract

The inheritance problem can be simply stated: for any instantiation of an inheritance network, say a specific hierarchy Γ, find a conclusion set for Γ. In other words, find out what is logically entailed by Γ. This can be done in two ways: either by defining a deductive or proof theoretic definition to determine what paths are entailed by a network; or by translating the individual links in the network to a more general nonmonotonic logic and using its model and proof theory to generate entailments that correspond to what one would expect from “viewing” the inheritance hierarchy. Two approaches to a solution to the inheritance problem structure this paper. The first is widely known as the “path-based” or “proof theoretic”, and the second, the “Model-based” or “model theoretic”. The two approaches result in both a different interpretation of default links as well as a variation in the entailment strategy for a solution to teh inheritance problem. In either case, the entailments produced need some intuitive interpretation, which can be either credulous or skeptical. The semantics of both skeptical and credulous inheritance reasoners are examined.

Copyright

References

Hide All
Bacchus, F, 1988. Representing and reasoning with probabilistic knowledge. PhD theseis, Department of Computer Science, University of Waterloo, Ontario, Canada.
Bacchus, F, 1989. “A modest, but semantically well founded, inheritance reasoner”. In: International Joint Conf. on Artificial Intelligence, pp 11041109.
Belnap, N, 1976. “How a computer should think”. In: Ryle, G (ed.), Contemporary Aspects of Philosophy, pp 3055. Oriel Press.
Belnap, N, 1977. “A useful four valued logic”. In: Dunn, J and Epstein, G (eds.), Modern Uses of Multiple Valued Logic, pp 837. Reidel.
Bläsius, K, Hedück, U and Rollinger, C (eds.), 1990. Sorts and Types in Artificial Intelligence: Lectures Notes on AI Vol 418. Springer-Verlag.
Boutilier, C, 1989. “A semantical approach to stable inheritance reasoning”. In: International Joint Conf. on Artificial Intelligence, 11341139.
Brachman, R, 1985. “I lied about the trees or defaults and definitions in knowledge representation”. AI Magazine, Fall 8093.
Buchanan, B and Shortliffe, E, 1984. Rule-bases Expert Systems: The MYCIN Experiments. Reading, MA: Addison-Wesley.
Borgida, A and Williamson, K, 1985. “Accommodating exceptions in databases and refining the schema by learning from them”. In: Proceedings of VLDB. Stockholm.
Cross, C and Thomason, R, 1987. “Update and conditionals”. In: International Symposium on Methodologies for Intelligence Systems.
Doherty, P, 1989. “A correspondence between inheritance hierarchies and a logics of preferential entailment”. In: International Symposium on Methodologies for Intelligent Systems.
Doherty, P, 1991. NML: A nonmonotonic formalism with explicit defaults. Phd, Institutionen för Datavetenskap, University of Linköping.
Eklund, P, 1991. “Negotiating inheritance taxonomies in conceptual structures”. In: 3rd Scandinavian Conference on AI, pp 211221. Roskilde, Denmark.
Etherington, D and Reiter, R, 1983. “On inheritance hierarchies with exceptions”. In: National Conference on Artificial Intelligence, pp 104108.
Etherington, D, 1987a. “Formalizing nonmonotonic reasoning systems”. Artificial Intelligence 31 4185.
Etherington, D, 1987b. “More on inheritance hierarchies with exceptions”. In: National Conference on Artificial Intelligence, pp 352357.
Etherington, D, 1988. Reasoning with Incomplete Information: Research Notes in AI. See Mateo, CA: Morgan-Kaufmann.
Fahlman, S, 1979. NETL: A System for Representing and Using Real-World Knowledge. Cambridge, MA: MIT Press.
Lenzerini, M, Donini, F and Nardi, D, 1991. “Tractable concept languages”. In: International Joint Conf. on Artificial Intelligence, pp 458463.
Froidevaux, C and Kayser, D, 1988. “Inheritance in semantic networks and default logicz”. In: Smets, P, Mamdani, E, Dubious, D and Prade, H (eds.), Non-Standard Logics for Automated Reasoning, pp 179212. New York, NY: Academic Press.
Gabbay, D, 1985. “Theoretical foundations for non-monotonic reasoning in expert systems”. In: Krzysztof, R (ed), Logics and Models of Concurrent Systems, pp 439457. Berlin: Springer-Verlag.
Geffner, H, 1989. Default reasoning: Causal and conditional theories. PhD thesis, Cognitive Systems Laboratory, Department of Computer Science, UCLA, CA.
Ginsberg, M, 1990. “A local formalization of inheritance: Preliminary report”. In: 3rd International Workshop on Nonmonotonic Reasoning, pp 1191292. Lake Tahoe, CA.
Gelfond, M and Przymusinska, H, 1990. “Formalization of inheritance reasoning in autoepistemic logic”. In: 3rd International Workshop on Nonmonotonic Reasoning, 73107. Lake Tahoe, CA.
Gelfond, M and Przymusinska, H, 1990. “Formalization of inheritance reasoning in autoepistemic logic”. Fundamenta Informaticae 13 (4) 403444.
Geffner, H and Verma, T, 1989. “Inheritance = chaining + defeat”. In: International Symposium on Methodologies for Intelligent Systems.
Hägglund, S, 1989. “Iterative design and adaptive maintenance of knowledge-based office systems”. Office information Systems: The Design Process. Amsterdam: North-Holland.
Haugh, B, 1988. “Tractable theories of multiple defeasible inheritance in ordinary nonmonotonic logics”. In: National Conference on Artificial Intelligence, pp 421426.
Hayes, P, 1977. “In defence of logic”. In: International Joint Conf. on Artificial Intelligence, pp 559564.
Horty, J, 1990a. “A credulous theory of mixed inheritance”. In: Lenzerini, M (ed), Inheritance Hierarchies in Knowledge Representation. Chichester: Wiley.
Horty, J, 1990b. “A skeptical theory of mixed inheritance”. In: Dunn, J and Cupta, A (eds.), Truth or Consequences, pp 267281. Amsterdam: Kluwer.
Horty, J and Thomasen, R, 1988. “Mixing strict and defeasible inheritance”. In: National Conference on Artificial Intelligence, pp 427432.
Horty, J, Thomason, R and Touretzky, D, 1990. “A skeptical theory of inheritance in nonmonotonic semantic networks”. Artificial Intelligence 42 311348.
Krishnaprasad, T and Kifer, M, 1989. “An evidence-based framework for a theory of inheritance”. In: International Joint Conf. on Artificial Intelligence, pp 10931098.
Krishnaprasad, T, Kifer, M and Warren, D, 1989. “On the declarative semantics of inheritance network”. In: International Joint Conf. on Artificial Intelligence, pp 10991103.
Krishnaprasad, T, 1989. The semantics of inheritance networks. Phd thesis, Department of Computer Science, State University of New York, Stony Brook, NY.
Loui, R, 1986. “Defeat among arguments: A system of defeasible inference”. Technical Report TR190, Department of Computer Science, University of Rochester.
McCarthy, J and Hayes, P, 1981. “Some philosophical problems from the standpoint of AI”. In: Webber, B L and Nilsson, N (eds.), Readings in AI, pp 431451. Los Angeles, CA: Morgan Kaufmann.
Moore, R, 1988. “Autoepistemic logic”. In: Smets, P, Mamdani, E, Dubious, D and Prade, H (eds.), Non-Standard Logics for Automated Reasoning, pp 105127. New York, NY: Academic Press.
Makinson, D and Schlechta, K, 1989. “Floating conclusions and zombie paths”. In: 2nd International Workshop on Nonmonotonic Reasoning, Sankt Augustin, FRG.
Makinson, D and Schlechta, K. 1991. “Floating conclusions and zombie paths: Two deep difficulties in the directly skeptical approach to defeasible inheritance nets”. 48 199209.
Nebel, B, 1990. “Terminological reasoning is inherently intractable”. Artificial Intelligence 43 (2) 235249.
Padgham, I, 1988. “A model and representation for type information and its use in reasoning with defaults”. In: National Conference on Artificial Intelligence, pp 409414.
Padgham, L, 1989a. “Negative reasoning using inheritance”. In: International Joint Conf. on Artificial Intelligence, pp 10861092.
Padgham, L, 1989b. Non-monotonic inheritance for an object-orientated knowledge-base. Phd thesis. Institutionen för datavetenskap, University of Linköping.
Pearl, J, 1987. “Deciding consistency in inheritance networks”. Technical Report CSD 870053: R96, UCLA.
Pearl, J, 1988. Probabilistic Reasoning in Intelligent Systems. San Mateo, CA: Morgan-Kaufman.
Poole, D, 1985. “On the comparison of theories: Preferring the most specific explanation”. In: International Joint Conf. on Artificial Intelligence, pp 144150.
Patel-Scheider, P, 1989. “Undecidability of subsumption in nikl*”. Artificial Intelligence 39 263271.
Reiter, R and Crisuolo, G, 1981. “On interacting defaults”. In: International Joint Conf. on Artificial Intelligence, pp 270276.
Reiter, R, 1980. “A logic for default reasoning”. AI Journal 13 81132.
Sandewall, E, 1986. “Nonmonotonic inference rules for multiple inheritance with exception”. In: IEEE, pp 13451353.
Schubert, L, 1976. “Extending the expressive power of semantic networks”. Artificial Intelligence 7 163198.
Schlechta, K, 1989. “Directly sceptical inheritance cannot capture the intersection of extension”. In: Workshop on Nonmonotonic Reasoning, Sankt Augustin, FRG.
Shoham, Y, 1988. Reasoning about Change. Cambridge, MA: MIT Press.
Selman, B and Kautz, H, 1988. “The complexity of model-preference default theories”. In: Reinfrank, M, de Kleer, J, Ginsberg, M and Sandewall, E (eds.), 2nd International Workshop on Nonmonotonic Reasoning, pp 115130. Springer-Verlag. Grassau, FRG.
Lehmann, D, Kraus, S and Magidor, M. 1990. “Nonmonotonic reasoning, preferential models and cumulative logics”. 44 167207.
Selman, B and Levesque, H, 1989. “The tractibility of path-based inheritance”. In: International Joint Conf on Artificial Intelligence, pp 11401145.
Stein, LA, 1989. “Skeptical inheritance: Computing the intersection of credulous extensions”. In: International Joint Conf. on Artificial Intelligence, pp 11531158.
Stein, I, 1990. “A preference-based approach to inheritance”. In: 3rd International Workshop on Nonmonotonic Reasoning, pp 233245. Lake Tahoe, CA.
Thomason, R, Horty, J and Touretzky, D, 1987. “A calculus for inheritance in monotonic semantic nets”. In: International Symposium on Methodologies for Intelligent Systems, pp 282287. Elsevier.
Touretzky, D, Horty, J and Thomason, R, 1987. “A clash of intuitions: The current state of nonmonotonic multiple inheritance systems”. In: International Joint Conf. on Artificial Intelligence, pp 476482.
Touretzky, D, Horty, J and Thomason, R, 1987. “A skeptical theory of inheritance in nonmonotonic semantic networks”. In: National Conference on Artificial Intelligence, pp 358363.
Touretzky, D, 1984a. “Implicit ordering of defaults in inheritance systems”. In: International Joint Conf. on Artificial Intelligence, pp 322325.
Touretzky, D, 1984b. “The mathematics of inheritance systems”. Technical Report CMU-CS-84–136, CMU.
Touretzky, D, 1986. The Mathematics of Inheritance Systems: Research Notes in Al. San Mateo, CA: Morgan-Kaufmann.
Touretzky, D and Thomason, R, 1988. “Nonmonotonic inheritance and generic reflexives”. In: National Conference on Artificial Intelligence, pp 433438.
Thomason, R and Touretzky, D, 1990. “Inheritance theory and networks with roles”. Technical Report CMU-CS-90–139, CMU.

Related content

Powered by UNSILO

Research developments in multiple inheritance with exceptions

  • Peter W. Eklund (a1)

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.