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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. L. Brodie,The Application of Data Types to Database Semantic Integrity (TR-833, University of Maryland, 1979).
B. Kahn, S. Navathe, D. Smith, and S. Su, “Area II: Information Analysis and Definition,” in1978 New Orleans Data Base Design Workshop Report, chairman V. Lum (1978).
“ANSI/X3/SPARC Study Group on Data Base Management Systems: Interim Report, FDT,” (Bulletin ofACM SIGMOD) 7(2) (1975).
N. J. Nilsson,Problem-solving Methods in Artificial Intelligence (McGraw-Hill, New York, 1971).
P. Chen, “The Entity-Relationship Model—Toward a Unified View of Data,”ACM-TODS 1(1) (1976).
C. S. Santos, E. J. Neubold, and A. L. Furtado, “A Data Type Approach to the Entity-Relationship Model,” (Proc. of the Int. Conf. on the Entity—Relationship Approach to System Analysis and Design, 1979).
M. L. Brodie and J. Schmidt, “What is the Use of Abstract Data Types in Data Bases?,”Proc. VLDB'4 (1978).
J. Minker, “Search Strategy and Selection Function for an Inferential Relational System.”ACM-TODS 3(1) (1978).
J. Minker, “An Experimental Relational Data Base System Based on Logic,” inLogic and Data Bases (H. Gallaire and J. Minker, eds.) (Plenum Press, New York, 1978, pp. 107–148).
R. Reiter, “On Closed World Bases,” inLogic and Data Bases (H. Gallaire and J. Minker, eds.) (Plenum Press, New York, 1978, pp. 55–76).
H. B. Enderton,A Mathematical Introduction to Logic (Academic Press, New York, 1972).
J. A. Robinson, “A Machine Oriented Logic Based on the Resolution Principle,”JACM 12(1) (1965).
C. Green, “Theorem Proving by Resolution as a Basis for Question Answering Systems,” inMachine Intelligence (B. Meltzer and D. Michie, eds.) (American Elsevier Publishing Co., New York, 1969, pp. 183–205).
K. L. Clark, “Negation as Failure,” inLogic and Data Bases (H. Gallaire and J. Minker, eds.) (Plenum Press, New York, 1978, pp. 293–322).
P. Roussel, “PROLOG Manuel de Reference et d'Utilization, Groupe d'Intelligence Artificielle” (V.E.R., de Luminy, Université d'Aix-Marseille, Sept. 1975).
D. Warren, “Implementing PROLOG—Compiling Predicate Logic Programs,” (Dept. of Artificial Intelligence, Technical Report no. 39, University of Edinburgh, 1977).
M. H. van Emden, R. A. Kowalski, “The Semantics of Predicate Logic as a Programming Language,”JACM 23: 733–742 (1976).
J. A. Goguen, J. W. Thatcher, and E. G. Wagner, “An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types,” inCurrent Trends in Programming Methodology, Vol. IV, (R. T. Yeh, ed.) (Prentice-Hall, New York, 1978).
F. Manola, “A Review of the 1978 CODASYL Database Specification,”Proc, VLDB'4 (1978).
T. L. Booth,Sequential Machines and Automata Theory (John Wiley, Reading, 1967).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Santos, C.S.d., Maibaum, T.S.E. & Furtado, A.L. Conceptual modeling of data base operations. International Journal of Computer and Information Sciences 10, 299–314 (1981). https://doi.org/10.1007/BF00993149
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00993149