On first-order-logic databases
- 1 September 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 12 (3) , 325-349
- https://doi.org/10.1145/27629.27630
Abstract
The use of first-order logic as database logic is shown to be powerful enough for formalizing and implementing not only relational but also hierarchical and network-type databases. It enables one to treat all the types of databases in a uniform manner. This paper focuses on the database language for heterogeneous databases. The language is shown to be general enough to specify constraints for a particular type of database, so that a specification of database type can be “translated” to the specification given in the database language, creating a “logical environment” for different views that can be defined by users. Owing to the fact that any database schema is seen as a first-order theory expressed by a finite set of sentences, the problems concerned with completeness and compactness of the database logic discussed by Jacobs ("On Database Logic,” J. ACM 29 ,2 (Apr. 1982), 310-332) are avoided.Keywords
This publication has 16 references indexed in Scilit:
- HOLMES: A deduction augmented database management systemInformation Systems, 1984
- The Format ModelJournal of the ACM, 1984
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- ON DEDUCTIVE RELATIONAL DATABASES?Annals of the New York Academy of Sciences, 1983
- On Database LogicJournal of the ACM, 1982
- On the Equivalence of Database ModelsJournal of the ACM, 1982
- The functional data model and the data languages DAPLEXACM Transactions on Database Systems, 1981
- The entity-relationship model—toward a unified view of dataACM Transactions on Database Systems, 1976
- On semantic issues in the relational model of dataPublished by Springer Nature ,1976
- The Solvability of the Decision Problem for Classes of Proper Formulas and Related ResultsJournal of the ACM, 1973