A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Natural language question-answering systems: 1969
Communications of the ACM
A deductive question-answerer for natural language inference
Communications of the ACM
Answering English questions by computer: a survey
Communications of the ACM
The converse natural language data management system: current status and plans
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Understanding Natural Language
Understanding Natural Language
A Deductive Capability for Data Management
Systems for Large Data Bases
The deductive pathfinder: creating derivation plans for inferential question-answering.
The deductive pathfinder: creating derivation plans for inferential question-answering.
A Search Technique for Clause Interconnectivity Graphs
IEEE Transactions on Computers
| Hi-index | 0.00 |
The design and prototype implementation of a deductive processor for efficient extraction of implicit information from explicit data stored within a relational data-base system is described. General statements (premises or inference rules) as well as queries are expressed in a canonical form as implications. From user queries, the system constructs skeletal derivations (proof plans) through the use of a predicate connection graph, a pre-computed net structure representing possible deductive interactions among the general statements. The system incorporates techniques for rapid selection of small sets of relevant premises (by proof planning); development and elaboration of proof plans; proof plan verification; use of proof plans as a basis for determining data-base access strategies; and instantiation of plans (i.e., turning proof plans into proofs) with retrieved data-base values. Examples of the current capability of the system are illustrated.