Ronald M. Lee
ABSTRACT
This paper examines the notion of a generalization abstraction proposed by Smith and Smith and considers the properties of a collection of generalizations as a unit called a 'generalization hierarchy'. Presented here is a more detailed representation which consists of a hybrid between a (graphical) network and a predicate calculus formalism.
- Codd, E. F. "A Relational Model of Data for Large Shared Data Banks," Communications of the ACM 13 (June 1970): 377 - 387. Google Scholar
Digital Library
- Codd, E. F. "Further Normalization of the Data Base Relational Model." In Data Base Systems, pp. 33 - 64. Edited by Randall Rustin. Englewood Cliffs, NJ: Prentice-Hall, 1972.Google Scholar
- Codd, E. F. "Relational Completeness of Data Base Sublanguages." In Data Base Systems, pp. 65 - 98. Edited by Randall Rustin. Englewood Cliffs, NJ: Prentice-Hall, 1972.Google Scholar
- Eswaran, Kapali P. and Chamberlin, Donald D. "Functional Specifications of a Subsystem for Data Base Integrity." Proceedings of the International Conference on Very Large Data Bases. Framingham, MA: September 1975, pp. 48 - 68.Google Scholar
- Hammer, Michael M. and McLeod, Dennis J. "Semantic Integrity in a Relational Data Base System." Proceedings of the International Conference on Very Large Data Bases, Framingham MA: September 1975, pp. 25 - 47.Google Scholar
- Hammer, Michael M. and McLeod, Dennis J. "A Framework for Data Base Semantic Integrity." Proceedings of the Second International Conference on Software Engineering, San Francisco CA: October, 1976. Google ScholarDigital Library
- Scragg, Greg. "Semantic Nets as Memory Models." in Computational Semantics, pp. 101 - 127. Edited by Eugene Charniak and Yorick Wilks. Amsterdam: North-Holland Publishing Co., 1976.Google Scholar
- Smith, John Miles and Smith, Diane C. P. "Database Abstractions: Aggregation and Generalization." ACM Transactions on Database Systems 2 (June 1977): 105 - 133. Google ScholarDigital Library
- Smith, John Miles and Smith, Diane C. P. "Integrated Specifications for Abstract Systems." Technical Report UUCS-7-112, Department of Computer Science, University of Utah, Salt Lake City, UT, September, 1977.Google Scholar
- Tarski, Alfred. Introduction to Logic. New York: Oxford University Press, 1965.Google Scholar
- Wong. Harry K. T. and Mylopoulos, John. "Two Views of Data Semantics: A Survey of Data Models in Artificial Intelligence and Database Management." A.I. Memo 77-2, Department of Computer Science, University of Toronto, December, 1976.Google Scholar
- Woods, William A. "Transition Network Grammars for Natural Language Analysis", Communications of the ACM 13. No. 10 (October 1970): 591 - 606. Google ScholarDigital Library
- Zisman, Michael D. "Use of Production Systems for Modelling Asynchronous, Concurrent Processes." Working Paper 77-04-01, The Decision Sciences Department, Wharton School, University of Pennsylvania, April 1977.Google Scholar
Recommendations
Consistency Checking in Complex Object Database Schemata with Integrity Constraints
Integrity constraints are rules that should guarantee the integrity of a database. Provided an adequate mechanism to express them is available, the following question arises: Is there any way to populate a database which satisfies the constraints ...
A Possible World Semantics for Disjunctive Databases
The fundamental problem that arises when a ground atom in a disjunctive database is assumed false is discussed. There are basically two different approaches for inferring negative information for disjunctive databases: J. Minker's (1982) generalized ...
(Bi)simulations up-to characterise process semantics
We define (bi)simulations up-to a preorder and show how we can use them to provide a coinductive, (bi)simulation-like, characterisation of semantic (equivalences) preorders for processes. In particular, we can apply our results to all the semantics in ...
Comments