Abstract
In this paper we are interested in inheritance networks called “legal” inspired by [4], especially by the problem of maintaining network's legality during an update in order to operate on a possible ambiguity. The ambiguity known as “Nixon Diamond” [14] is resolved on inserting an exception link that inhibits the inference on one path. But as there exists many possibilities to add exception link we ask the user to settle the question. After an update the network's legality is maintened on taking out the “responsable ancestrally” cycles of the ambiguities. These cycles are called aac's (ancestor ambiguous cycles). The ambiguity's resolution at level of an aac entails the systematic resolution of ambiguous cycles having aac as ancestor. The number of aac allows to answer the question “what is the number of exception links to add to the network (or number of questions to ask to the user) in order to keep it in a legal state”.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge: Graphes et hypergraphes. Dunod. Paris, 1970.
P. Coupey: Etude d'un réseau sémantique avec gestion des exceptions. Interprétation logique et implantation informatique. Thèse de Docteur d'Université, LIPN, Université Paris Nord, 1989.
D.W. Etherington, R. Reiter: On inheritance hierarchies with exceptions. Proceedings of AAAI 83, Washington, DC 1983, pp 104–108.
S.E. Fahlman, D.S. Touretzky, W.V. Roggen: Cancellation in a parallel semantic network. Proceedings of IJCAI, 24–28 August 81, pp 257–263.
C. Froidevaux, D. Kayser: Inheritance in semantic networks and in default logic. In: P. Smets et al. (eds), Non standard logics for automated reasoning, Academic Press, New York, 1988.
E. Grégoire: Logiques non monotones. Programmes logiques stratifiés et théories sceptiques de l'héritage. Thèse de doctorat en sciences appliquées. Université Catholique de Louvain, Juin 1989.
E. Grégoire: Skeptical inheritance can be more expressive. Proc. 9th ECAI, August 90, Stockholm.
J.F. Horty, R.H. Thomason, D.S. Touretzky: A skeptical theory of inheritance in non monotonic semantic networks. Proceedings of AAAI 87, pp 358–363.
J.F. Horty, R.H. Thomason: Mixing strict and defeasible inheritance. Proceedings of AAAI 88, volume 2, pp 427–432.
J.F. Horty, R.H. Thomason, D.S. Touretzky: A skeptical theory of inheritance in non monotonic semantic networks. A.I., volume 42, number 2–3, March 90, pp 311–348.
Daniel Kayser: Cours de DEA. LIPN. Université Paris 13. Villetaneuse.
Nacéra Madani: Héritage dans les réseaux légaux. paper submitted to le J.F.J.C, Rennes 1992.
Y. Moinard: Donner la préférence au défaut le plus spécifique. Actes 6ème congrés AFCET Reconnaissance des Formes et Intelligence Artificielle, Antibes, 1987, pp 1123–1132.
R. Reiter, G. Criscuolo: On interacting defaults. Proc. IJCAI 81, pp 270–276.
D.S. Touretzky, J.F. Horty, R.H. Thomason: A clash of intuitions: the current state of non monotonic multiple inheritance systems. Proceedings of AAAI 87, pp 476–482.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag
About this paper
Cite this paper
Madani, N. (1993). Legality in inheritance networks. In: Bouchon-Meunier, B., Valverde, L., Yager, R.R. (eds) IPMU '92—Advanced Methods in Artificial Intelligence. IPMU 1992. Lecture Notes in Computer Science, vol 682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56735-6_43
Download citation
DOI: https://doi.org/10.1007/3-540-56735-6_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56735-6
Online ISBN: 978-3-540-47643-6
eBook Packages: Springer Book Archive