Logic and Data Bases pp 107-147 | Cite as

# An Experimental Relational Data Base System Based on Logic

## Abstract

An experimental relational data base system whose design is based upon logic is described. Logic was chosen as the design principle since it is a useful way in which to represent knowledge, and it forms a mathematical basis both for reasoning with data and for maintaining the integrity of a data base. The latter is a needed capability of data base systems as one wants to derive new facts from facts listed explicitly in the data base.

The system is designed to handle large data bases and for general problems in theorem proving. The data base aspect of the work is emphasized in this paper.

Queries to the system consist of well-formed formulae in the predicate calculus. Knowledge in the system is stored in a semantic network. The semantic network consists of explicit facts stored in the extensional data base; general axioms, which permit new facts to be derived, and are stored in the intensional data base, the semantic graph which provides information sometimes represented as unary relations; the dictionary which defines constant symbols; and the semantic form space used for integrity constraints and testing inputs.

A description is provided of the system. The manner in which the extensional and intensional data bases are accessed, how deductive search is controlled, and the manner in which written and spoken natural language output is achieved are described in the paper.

## Keywords

Semantic Category Base Relation Semantic Network Horn Clause Semantic Action## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Basili, V. R. and Turner, A. J. [1976]
*SIMPL-T — A Structured Programming Language*, Paladin House, Geneva, Illinois, 1976. Also University of Maryland Computer Science Series, Vol. 2, University of Maryland, College Park, Maryland 20742.Google Scholar - 2.Carnap, R. [1958]
*Introduction to Symbolic Logic and Its Applications*, Dover Publications, Inc., New York, New York, 1958.MATHGoogle Scholar - 3.Chang, C.L. [1978] DEDUCE 2: Further Investigations of Deduction in Relational Data Bases, In
*Logic and Data Bases*(H. Gallaire and J. Minker, Eds.), Plenum Press, N. Y., 1978, 201–236.Google Scholar - 4.Chang, C.L. and Lee, R.C.T. [1973]
*Symbolic Logic and Mathematical Theorem Proving*, Academic Press, New York, New York, 1973.Google Scholar - 5.Codd, E. F. [1971] Relational Completeness of Data Base Sublanguages, Courant Computer Science Symposia 6, May 24–25, 1971. In
*Data Base Systems*(R. Rustin, Ed.), Prentice-Hall, Englewood Cliffs, New Jersey, 1972, 65–98.Google Scholar - 6.Darlington, J. L. [1962] A COMIT Program for the Davis-Putnam Algorithm,
*Res. Lab. Electron.*, Mech. Transi. Grp., M.I.T., Cambridge, Massachusetts, May 1962.Google Scholar - 7.Deliyanni, A. and Kowalski, R. A. [1977] Logic and Semantic Networks, Journées d’etudes Logique et bases de donees, Toulouse, France, Nov. 16–18, 1977.Google Scholar
- 8.Elovitz, H. S. [1975] “Automatic Text Translation to Speech Via Letter-to-Sound Rules,” Scholarly Paper, University of Maryland, College Park, Maryland 20742, May 1975.Google Scholar
- 9.Enderton, H. B. [1972]
*A Mathematical Introduction to Logic*, Academic Press, New York, New York, 1972.MATHGoogle Scholar - 10.Fishman, D. H. [1973] “Experiments with a Resolution-Based Deductive Question-Answering System and a Proposed Clause Representation for Parallel Search,” Ph.D. Thesis, Department of Computer Science, University of Maryland, College Park, Maryland, 1973.Google Scholar
- 11.Green, C. C. [1969] Theorem Proving by Resolution as a Basis for Question-Answering Systems, In
*Machine Intelligence 4*(B. Meltzer and D. Michie, Eds.), American Elsevier, New York, New York, 1969, 183–205.Google Scholar - 12.Green, C. C. and Raphael, B. [1968] The Use of Theorem Proving Techniques in Question-Answering Systems,
*Proceedings 1968 ACM National Conference*, Brandon Systems Press, Princeton, New Jersey, 1968, 169–181.Google Scholar - 13.Hill, R. [1974] LUSH Resolution and Its Completeness, DCL Memo No. 78, University of Edinburgh, School of Artificial Intelligence, August 1974.Google Scholar
- 14.Kellogg, C., Klahr, P. and Travis, L. [1978] Deductive Planning and Pathfinding for Relational Data Bases, In
*Logic and Data Bases*(H. Gallaire and J. Minker, Eds.), Plenum Press, New York, New York, 1978, 179–200.Google Scholar - 15.Klein, M. [1976] “Translating II-Clauses into English,” Scholarly Paper, Department of Computer Science, University of Maryland, College Park, Maryland 20742, 1976.Google Scholar
- 16.Kowalski R. and Kuehner, D. [1971] Linear Resolution with Selection Function,
*Artificial Intelligence2*, 3/4 (1971), 227–260.Google Scholar - 17.Loveland, D. W. [1969] A Simplified Format for the Model Elimination Theorem Proving Procedure,
*JACM16*, 3 (July 1969), 349–363.MathSciNetMATHCrossRefGoogle Scholar - 18.Luckham, D. and Nilsson, N. [1971] Extracting Information from Resolution Proof Trees,
*Artificial Intelligence2*, 1 (1971), 27–54.MathSciNetMATHCrossRefGoogle Scholar - 19.McSkimin, J. R. [1976] “The Use of Semantic Information in Deductive Question-Answering Systems,” Ph.D. Thesis, Department of Computer Science, University of Maryland, College Park, Maryland, 1976.Google Scholar
- 20.McSkimin, J.R. and Minker, J. [1978] A Predicate Calculus Based Semantic Network for Question-Answering Systems, In
*Associative Networks — The Representation and Use of Knowledge in Computers*(N. Findler, Ed.), Academic Press, New York 1978 (in press).Google Scholar - 21.McSkimin, J.R. and Minker, J. [1977] The Use of a Semantic Network in a Deductive Question-Answering System,
*Proceedings IJCAI-77;*Cambridge, Massachusetts, 1977, 50–58.Google Scholar - 22.McSkimin, J.R. and Wilson, G. A. [1974] MRPPS 2.0 User’s Manual, CN-15, Computer Science Center, University of Maryland, College Park, Maryland, November 1974.Google Scholar
- 23.Minker, J. [1978] Search Strategy and Selection Function for an Inferential Relational System,
*ACM Transactions on Database Systems3,1*(March 1978), 1–31.CrossRefGoogle Scholar - 24.Minker, J. [1977] Control Structures of a Pattern-Directed Search System,
*Proceedings of the Workshop on Pattern-Directed Inference Systems, ACM SIGART Newsletter*, No. 63 (June 1977), 7–14.Google Scholar - 25.Minker, J., Fishman, D. H. and McSkimin, J. R. [1973] The Q* Algorithm — A Search Strategy for a Deductive Question-Answering System,
*Artificial Intelligence4*, (1973), 225–243.MATHCrossRefGoogle Scholar - 26.Minker, J., McSkimin, J. R. and Fishman, D. H. [1974] MRPPS — An Interactive Refutation Proof Procedure System for Question Answering,
*J. Computers and Information Sciences3*, (June 1974), 105–122.MATHCrossRefGoogle Scholar - 27.Mylopoulos, J., Badler, N., Melli, L. and Roussopoulos, N. [1973] 1 PAK: A SNOBOL-Based Programming Language for Arfiticial Intelligence Applications.
*Advance Papers of 3rd Int. Joint Conf. on Artificial Intelligence*, Stanford University, Stanford, California, 1973, 691–696.Google Scholar - 28.Nicolas, J. M. and Syre, J. C. [1974] Natural Language Question-Answering and Automatic Deduction in the System SYNTEX,
*Proceedings of the IFIP Congress, 1974*, North-Holland Publishing Company, New York, New York, 1974,595–599.Google Scholar - 29.Powell, P. [1977] “Answer-Reason Extraction in a Parallel Relational Data Base System,” Master’s Thesis, Department of Computer Science, University of Maryland, College Park, Maryland 20742, 1977.Google Scholar
- 30.Powell, P. and Thompson, P. [1978] Natural Language and Voice Output for Relational Data Base Systems, TR-686, Department of Computer Science, University of Maryland, College Park, Maryland 20742, 1978.Google Scholar
- 31.Reiter, R. [1971] Two Results on Ordering for Resolution with Merging and Linear Format,
*JACM18*, 4 (October 1971), 630–646.MATHCrossRefGoogle Scholar - 32.Reiter, R. [1978] Deductive Question-Answering on Relational Data Bases, In
*Logic and Data Bases*(H. Gallaire and J. Minker, Eds.), Plenum Press, New York, New York, 1978, 149–177.Google Scholar - 34.Robinson, J. A. [1965] A Machine-Oriented Logic Based on the Resolution Principle,
*JACM12*, 1 (January 1965), 23–41.MATHCrossRefGoogle Scholar - 35.Schubert, L. K. [1976] Extending the Expressive Power of Semantic Networks,
*Artificial Intelligence7*, 2 (1976), 163–198.MathSciNetCrossRefGoogle Scholar - 36.Shapiro, S. C. [1971] A Net Structure for Semantic Information Storage, Deduction and Retrieval,
*Proceedings Inter. Joint Conf. on Artificial Intelligence*, The British Computer Society, London, 1971, 512–523.Google Scholar - 37.Shapiro, S. C. [1977] Representing and Locating Deduction Rules in a Semantic Network,
*Proceedings of the Workshop on Pattern-Directed Inference Systems, ACM SIGART Newsletter No. 63*(June 1977, 14–18.Google Scholar - 38.Thompson, P. [1976] “Rule Precedence within Context-Sensitive Grammars; An Extension of the Letter to Sound Rules Used in Voice Production,” Scholarly Paper, Department of Computer Science, University of Maryland, College Park, Maryland 20742, 1976.Google Scholar
- 39.Wilson, G. [1976] “A Description and Analysis of the PAR Technique — An Approach for Parallel Inference and Parallel Search in Problem Solving Systems,” Ph.D. Thesis, Dept. of Computer Science, University of Maryland, College Park, Maryland 20742, 1976. Also Tech. Report TR-464, Department of Computer Science, University of Maryland, 1976.Google Scholar
- 40.Woods, W. A. [1975] What’s in a Link — Foundations for Semantic Networks, In
*Representation and Understanding*(D. G. Bobrow and A. Collins, Eds.), Academic Press, New York, 1975, 35–82.Google Scholar