Abstract
The paper addresses the problem of specifying valid reasoning with roles and relations in inheritance networks. A system of (context free) rules is presented for monotonic inheritance networks with isa, identity, role and relational links. The system is then interpreted in a fragment of first-order logic, and the interpretation is shown to be sound and complete. Thus, any conclusion provable from a network is a logically valid consequence of the information in the network, and any logically valid consequence in the network query language is provable.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. A. de T. Guerreiro, A. Hemerly, and Y. Shoham, “On the complexity of monotonic inheritance with roles.” AAAI-90 (Proceedings of the Ninth National Conference on Artificial Intelligence). AAAI Press & MIT Press, Menlo Park, CA & Cambridge, MA, 1990, pp. 627–632.
L. Henkin, “The completeness of the first-order functional calculus.” Journal of Symbolic Logic 14 (1949), pp. 159–166.
J. Horty and R. Thomason, “Mixing strict and defeasible inheritance.” In AAAI-88 (Proceedings of the Seventh National Conference on Artificial Intelligence). Volume 2, Morgan Kaufmann, San Mateo, CA, 1988, pp. 427–432.
Montague, R., “The proper treatment of quantification in ordinary English.” In R. Montague, Formal philosophy, pp. 247–270. Yale University Press, New Haven, 1974.
R. Thomason and H. Leblanc, “Completeness theorems for some presupposition-free logics.” Fundamenta Mathematicae 62 (1968), pp. 125–164.
R. Thomason, “Completeness proofs for monotonic nets with relations and identity.” In Z. Ras et al., eds., Methodologies for intelligent systems. (Proceedings of the Fourth International Symposium on Methodologies for Intelligent Systems). North-Holland, Amsterdam, 1989, pp. 523–532.
R. Thomason, J. Horty, and D. Touretzky, “A calculus for inheritance in monotonic semantic nets.” Department of Computer Science, Carnegie Mellon University, 1986. Technical Report No. CMU-CS-86-138.
R. Thomason, J. Horty, and D. Touretzky, “A calculus for inheritance in monotonic semantic nets.” In Z. Ras and M. Zemankova (eds.), Methodologies for intelligent Systems (Proceedings of the Second International Symposium on Methodologies for Intelligent Systems), North-Holland, Amsterdam, 1987, pp. 280–287.
R. Thomason and D. Touretzky, “Inheritance theory and networks with roles.” In Principles of semantic networks, John Sowa, ed., Morgan Kaufmann, 1991.
J. van Benthem and A. ter Meulen, eds., Generalized quantifiers in natural language. Foris Publications, Dordrecht, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomason, R.H. (1991). A semantic analysis of monotonic inheritance with roles and relations. In: Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1991. Lecture Notes in Computer Science, vol 542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54563-8_126
Download citation
DOI: https://doi.org/10.1007/3-540-54563-8_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54563-7
Online ISBN: 978-3-540-38466-3
eBook Packages: Springer Book Archive