Abstract
Inheritance nets are used for the representation of hierarchical knowledge. If we allow the representation of positive and negative information, conflicts can occur. They are resolved according to the deduction strategy used (cp. [T 86], [HTT 87], [THT 87]) that is based on two fundamental principles: 1. A link is better than a compound path. 2. More specific information is better than less specific information. We doubt these principles and give an alternative approach instead. It is more general in that it allows to label the links in an inheritance net. The decision which path to believe depends on a partial order given on the labels of the net.
We will show that we can model preemption as defined by [T 86] and get the set of sceptical valid paths as the intersection of all possible sets of credulous valid paths.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Horty, John F.: Some Direct Theories of Nonmonotonic Inheritance, in: Gabbay, Dov M.: Hogger, C. J.; Robinson, J. A. (ed.): Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3, Clarendon Press, Oxford, 1994.
Horty, J. F.; Thomason, R. H.; Touretzky, D.S.: A skeptical theory of inheritance in nonmonotonic semantic nets. Proceedings of AAAI-87, 1987.
Selman, Bart; Levesque, Hector J.: The complexity of path-based defeasible inheritance, Artificial Intelligence 62 (1993), pp. 303–339.
Touretzky, D.S.: The Mathematics of Inheritance Systems, Morgan Kaufmann, Los Altos, CA, 1986.
Touretzky, D.S.: Horty, J. F.; Thomason, R. H.: A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems, IJCAI-87, pp 476–482, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neumann, I. (1996). Graded inheritance nets for knowledge representation. In: Gabbay, D.M., Ohlbach, H.J. (eds) Practical Reasoning. FAPR 1996. Lecture Notes in Computer Science, vol 1085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61313-7_92
Download citation
DOI: https://doi.org/10.1007/3-540-61313-7_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61313-8
Online ISBN: 978-3-540-68454-1
eBook Packages: Springer Book Archive