ISSN:
1573-7640
Keywords:
Data bases
;
entity relationship model
;
update operations
;
query operations
;
program synthesis
;
theorem-proving
;
resolution
;
state-space approach
;
axiomatic specification of data bases
;
abstract data types
;
many sorted logic
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract A formalism adequate for the specification of behavioral properties of data bases is proposed. The formalism is a many-sorted first order predicate calculus, including a formalized notion of data base state. Both update and query requests are modeled through expressions by the use of predicates supplied in the language of the formal system, and are treated uniformly as a theorem proving process. The process consists of using the axioms defining the data base for either synthesizing a valid sequence of update operations (if such exists) or for answering the query.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00993149
Permalink
