A class of first-order databases with no function signs is considered. A closed database DB is one for which the only existing individuals are those explicitly referred to in the formulas of DB. Formally, this is expressed by including in DB a domain closure axiom (<italic>x</italic>)<italic>x</italic> = <italic>c</italic><subscrpt>1</subscrpt> ∨···∨ <italic>x</italic> = <italic>c<subscrpt>p</subscrpt></italic>, where <italic>c</italic><subscrpt>1</subscrpt>,…,<italic>c<subscrpt>p</subscrpt></italic> are all of the constants occurring in DB. It is shown how to completely capture the effects of this axiom by means of suitable generalizations of the projection and division operators of relational algebra, thereby permitting the underlying theorem prover used for query evaluation to ignore this axiom.
A database is E-saturated if all of its constants denote distinct individuals. It is shown that such databases circumvent the usual problems associated with equality, which arise in more general databases.
Finally, it is proved for Horn databases and positive queries that only definite answers are obtained, and for databases with infinitely many constants that infinitely long indefinite answers can arise.
[1]
Lawrence J. Henschen,et al.
Unit Refutations and Horn Sets
,
1974,
JACM.
[2]
W. W. Bledsoe,et al.
Splitting and Reduction Heuristics in Automatic Theorem Proving
,
1971,
Artif. Intell..
[3]
Chin-Liang Chang.
DEDUCE 2: Further Investigations of Deduction in Relational Data Bases
,
1977,
Logic and Data Bases.
[4]
Jack Minker,et al.
Logic and Data Bases
,
1978,
Springer US.
[5]
Richard C. T. Lee,et al.
Symbolic logic and mechanical theorem proving
,
1973,
Computer science classics.
[6]
W. W. Bledsoe,et al.
Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
,
1971,
SGAR.
[7]
E. F. Codd,et al.
Relational Completeness of Data Base Sublanguages
,
1972,
Research Report / RJ / IBM / San Jose, California.
[8]
James Robb Mcskimin.
The use of semantic information in deductive question-answering systems.
,
1976
.