Abstract
The purpose of this paper is to present a first step in a formal study of inheritance systems.
The kind of systems considered are those that support overriding (all definitions being taken as defaults) and multiple inheritance. The overriding is based on the explicit statement of negative information.
The basic entities are classes and properties. The system is hierarchic because it is made out of classes which are structured as a hierarchy. We consider both the basic case of properties restricted to atomic propositional formulas and their negations, and the extension to properties defined by rules in the Logic Programming style.
A formal definition of hierarchic systems is given for which a model-theoretic 3-valued semantics is in roduced. This semantics is explicitly stated in terms of sets of individuals. It defines the notion of interpretation, the characterization of models, and what is meant by validity of formulas in such structures.
The inheritance mechanism is able to choose from a set of inherited default properties which ones must be overriden in order to guarantee that the local program has a model.
The notion of characteristic individuals of classes, introduced in our semantics, turns out to play a clarifying role of the relationship between semantic and syntactic aspects of inheritance systems.
Work done under partial support of Esprit BRA 3020 ”Integration” and Portuguese JNICT project PEROLA
Owns a scholarship from INIC.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gabriel David and António Porto. Semantics of inheritance in a propositional hierarchic system. Universidade Nova de Lisboa, 1991. RT 23/91-DI/UNL.
Michael Gelfond and Vladimir Lifschitz. Logic programs with classical negation. In David H. D. Warren and Peter Szeredi, editors, Logic Programming, page 579, Cambridge, MA, 1990. MIT Press.
Robert Kowalski and Fariba Sadri. Logic programs with exceptions. In David H. D. Warren and Peter Szeredi, editors, Logic Programming, page 598, Cambridge, MA, 1990. MIT Press.
John Wylie Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987.
Luís Monteiro and António Porto. Semantic and syntactic inheritance in logic programming. Universidade Nova de Lisboa, 1991. RT 24/91-DI/UNL.
Luís Moniz Pereira, José Júlio Alferes, and Joaquim Nunes Aparício. Contradiction removal within well founded semantics. In Logic Programming and Non-Monotonic Reasoning'91, 1991.
Teodor C. Przymusinski. Three-valued formalizations of non-monotonic reasoning and logic programming. In Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, editors, Principles of Knowledge Representation and Reasoning, page 341, San Mateo, CA, 1989. Morgan Kaufmann Publishers.
Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81, 1980.
David S. Touretzky. The Mathematics of Inheritance Systems. Pitman, London, 1986.
Raymond Turner. Logics for Artificial Intelligence. Ellis Horwood, Chichester, England, 1984.
Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of ACM, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
David, G., Porto, A. (1991). Semantics of property inheritance in a hierarchic system with explicit negation. In: Barahona, P., Moniz Pereira, L., Porto, A. (eds) EPIA 91. EPIA 1991. Lecture Notes in Computer Science, vol 541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54535-2_30
Download citation
DOI: https://doi.org/10.1007/3-540-54535-2_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54535-4
Online ISBN: 978-3-540-38459-5
eBook Packages: Springer Book Archive