Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
State-space problem-reduction, and theorem proving—some relationships
Communications of the ACM
A computer system for inference execution and data retrieval
Communications of the ACM
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
The use of theorem-proving techniques in question-answering systems
ACM '68 Proceedings of the 1968 23rd ACM national conference
From PLANNER to CONNIVER: a genetic approach
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
QLISP: a language for the interactive development of complex systems
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
| Hi-index | 0.00 |
This paper describes a new formalization of a deductive question answering system on a relational data base using a theorem proving technique. A theorem proving procedure for a finite domain is investigated and a direct proof procedure based on substitutions of equivalent formulas which employs the breadth first search is introduced. The search strategy is then expanded to set operations of the relational algebra which are in corporated into the proof procedure in order to increase the data base search efficiency. Virtual relations are realized by means of introducing several axioms and utilizing the deductive capability of the logical system. Furthermore, a conditional domain is, introduced as one of the virtual domains and is used to give a relational view to a pseudo relational data base which can represent exceptional cases using some link information. A query transformation system called DBAP (Data Base Access Planner) which embodies those features is implemented in QJJSP.