On first-order-logic databases

@article{Rybinski1987OnFD,
  title={On first-order-logic databases},
  author={Henryk Rybinski},
  journal={ACM Trans. Database Syst.},
  year={1987},
  volume={12},
  pages={325-349}
}
  • H. Rybinski
  • Published 1 September 1987
  • Computer Science
  • ACM Trans. Database Syst.
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… 

Figures and Tables from this paper

Data Models and Languages for Databases
TLDR
Extensions of the relational model that allow users to specify and manipulate structurally complex objects and their languages are discussed, including a formal model for objects with identity, and declarative languages for the model.
A unifying logic-based formalism for semantic data models
TLDR
In this paper a first-order logic is introduced as a common formalism for analyzing Semantic Data Models and the notion of a semantic database domain is introduced to provide a set-theoretic basis for the logic formalism.
A software architecture for heterogeneous distributed database systems (abstract and references only)
TLDR
This short report proposes an architecture that supports the idea of a uniform layer of database logic based on database logic and the mapping between the unified schema and the fragment clusters in the system.
A logic for object-oriented logic programming
TLDR
The proposed logic has a sound and complete resolution-based proof procedure and elegantly combines the object-oriented and value-oriented paradigms and contains all of the predicate calculus as a special case.
Logic Based Programmed Structure Rewriting Systems
TLDR
A new logic based framework for the formal treatment of graph rewriting systems as special cases of programmed rewriting systems for arbitrary relational structures that surpasses almost all variants of nonparallel algebraic as well as algorithmic graph grammar approaches by offering set-oriented pattern matching facilities and nonmonotonic reasoning capabilities for checking pre- and postconditions of rewrite rules.
Logic Based Programmed Structure Rewriting Systems 1
TLDR
A new logic based framework for the formal treatment of graph rewriting systems as special cases of programmed rewriting systems for arbitrary relational structures that surpasses almost all variants of nonparallel algebraic as well as algorithmic graph grammar approaches by offering set-oriented pattern matching facilities and nonmonotonic reasoning capabilities for checking preand postconditions of rewrite rules.
An Algorithmic Logic Approach to Formalizing Database Update Semantics
TLDR
This paper investigates a formal system for this purpose called Event-Formula Logic (EFL), focused on characterizing correctness of database updates, and demonstrates its applicability from two perspectives.
Programmed Graph Replacement Systems
TLDR
This chapter introduces the basic framework of PLSR systems and studies the essential properties of context-sensitive graph replacement approaches themselves as well as popular rule regulation mechanisms.
...
1
2
3
4
...

References

SHOWING 1-10 OF 47 REFERENCES
On Database Logic
TLDR
The key defimuons for database logic are estabhshed, it is demonstrated how the logtc may be used to design a generahzed calculus data mampulauon language for heterogeneous databases, and several of the major properties ofdatabase logic are discussed.
Logic and Databases: A Deductive Approach
TLDR
It is shown that logic provides a convenient formalism for studying classical database problems and the representation and manipulation of deduced facts and incomplete information is shown.
ON DEDUCTIVE RELATIONAL DATABASES * †
TLDR
It will be argued here that a relational database can be understood best by relating it to mathematical logic, and by viewing relational databases in terms of logic, one can handle a wider class of problems than in the model of relational databases originally proposed by Codd.
Non first normal form relations to represent hierarchically organized data
TLDR
A database model, namely, the Verso model, where data is organized in non 1NF relations, by using relation as underlying structure, to preserve some of the positive features of the relational model, for instance, a simple algebraic query language.
Towards a Logical Reconstruction of Relational Database Theory
  • R. Reiter
  • Computer Science
    On Conceptual Modelling
  • 1982
Insofar as database theory can be said to owe a debt to logic, the currency on loan is model theoretic in the sense that a database can be viewed as a particular kind of first order interpretation,
UNIBASE - An Integrated Access to Databases
TLDR
The relational model is established as a common view of different databases as well as a formula language used for the definition of query, assertion, constraint, and transformation rules.
On the Equivalence of Database Models
TLDR
It is proved that network databases with loop-free Bachman diagrams are superior to relational databases which are free of conflicts and contenUons and shown that the decomposition approach can be apphed to conflictand contention-free relational databases without any of these problems.
First order logic formalization for functional, multivalued and mutual dependencies
TLDR
It is shown that first order logic is adequate for formalizing functional, multivalued and mutual dependencies in relational data bases and advantages of using logic instead of tailored formal systems are presented.
...
1
2
3
4
5
...