State-space problem-reduction, and theorem proving—some relationships
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
A problem-oriented inferential database system
ACM Transactions on Database Systems (TODS)
The universal relation revisited (technical correspondence)
ACM Transactions on Database Systems (TODS)
Search strategy and selection function for an inferential relational system
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Nonprocedural query processing for databases with access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A Kernel design for a secure data base management system
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Equivalence among relational expressions with the union and difference operation
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Knowledge-based query processing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Evaluating queries in deductive databases by generating
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
IBM Systems Journal
| Hi-index | 0.00 |
In a relational data base, if a relation is listed explicitly in the data base, then questions asking whether the relation exists can be retrieved readily. There are questions that may be posed to such a system in which, although the answer is not listed in an explicit form, nonetheless, the answer is implicit within the system. In this paper, an algorithm is presented which will permit questions to be answered where the answer is implicit within the data base. One must infer the answer from the given relations. The problem of performing inferences is related to developments in the field of artificial intelligence: state-space, problem-reduction, and theorem-proving techniques all apply. It is shown how the answer to the question may be extracted, and the reasons for the deduction may be given. Developments required to construct an operational relational system for large data base problems with an inferential capability are discussed.