A unifying logic-based formalism for semantic data models
Pages 342 - 348
References
[1]
Abiteboul, S., Hull, R., "IFO: A formal semantic database model", A CM Trans. on Database Systems,12,4 (Dec. 1987) 525- 565.
[2]
Brodie, M., "Data abstraction for designing database-intensive applications", Proc. Workshop on Data Abstraction, Databases and Conceptual Modelling, June 23- 26 1980, Pingree Park, Colorado, 101-103.
[3]
Chert, P., "The entity-relationship model - toward a unified view of data", ACM Trans. on Database Systems, 1,1 (March 1976)9-36.
[4]
Codd, E., "Extending the database relational model to capture more meaning", ACM Trans. on Database Systems, 4,4 (Dec. 1979) 397-434.
[5]
Hammer, M., "Data abstractions for databases", Proc. Workshop on Data Abstraction, Databases and Conceptual Modelling, June 23-26 J980, Pingree Park, Colorado, 77-82.
[6]
Hull, R., Yap, C., "The format model: A theory of database organization", Journal of the ACM, 31, 3 (July 1984) 518-537.
[7]
jacobs, B., "On database logic", Journal of the ACM, 29, 2 (Apr. 1982) 310-332.
[8]
Kuper, G., Vardi, M., "A new approach to database logic", Proc. 3rd ACM Syrup. on Principles of Database Systems, Apr. 2-4, 1984, Waterloo, Ontario, Canada, 86-96.
[9]
McLeod, D., Smith, J., "Abstractions in databases", Proc. Workshop on Data Abstraction, Databases and Conceptual Modelling, June 23-26 1980, Pingree Park, Colorado, 19-25.
[10]
Mendelsort, E., "Introduction to Mathematical Logic," Van Nostrand, NY (1964).
[11]
Rybinski, H., "On first order logic databases", ACM Trans. on Database Systems, 12,3 (Sept. 1987) 325-349.
[12]
Shipman, D., "The functional data model and the data language DAPLEX", ACM Trans. on Database Systems, 6,1 (March 1981) 140-173.
[13]
Smith, D., Smith, J., "Database abstractions: aggregation", Communications of the ACM, 20,6 (June 1977) 405-413.
[14]
Smith, D., Smith, J.,"Database abstractions: aggregation and generalization", ACM Trans. on Database Systems, 2,2 (June 1977) 105-133.
[15]
Vorbach, J., "A undying logic-based formalism for semantic data models", Ph.D Dissertatation, Dept of Computer Science and Statistics, University of Rhode Island, Kingston, RI (1990)
- A unifying logic-based formalism for semantic data models
Recommendations
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L ∈ {KD5,KD45,S5}, or L ∈ {KD,T,KDB,B} and the modal depth of P is ...
Axioms and models of linear logic
AbstractGirard's recent system of linear logic is presented in a way that avoids the two-level structure of formulae and sequents, and that minimises the number of primitive function symbols. A deduction theorem is proved concerning the classical ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 1991
711 pages
Copyright © 1991 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1991
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 317Total Downloads
- Downloads (Last 12 months)39
- Downloads (Last 6 weeks)9
Reflects downloads up to 16 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in