ACM Home Page
Please provide us with feedback. Feedback
The use of theorem-proving techniques in question-answering systems
Full text PdfPdf (1.06 MB)
Source ACM Annual Conference/Annual Meeting archive
Proceedings of the 1968 23rd ACM national conference table of contents
Pages: 169 - 181  
Year of Publication: 1968
Authors
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 48,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800186.810578
What is a DOI?

ABSTRACT

For the purpose of this paper, a question-answering system is a computer program that has at least the following three characteristics: (1) The ability to accept statements of fact and store them in its memory (2) The ability to search stored information efficiently and to recognize items that are relevant to a particular query (3) The ability to respond appropriately to a question by identifying and presenting the answer if it is present in memory, and by deducing a reasonable logical response from relevant knowledge if the complete answer is not explictly available.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
K M COLBY H ENEA Heuristic methods for computer understanding of natural language in context-restricted on-line dialogue Dept of Computer Sciences Stanford University 196
 
3
J A CRAIG et al DEACON: direct english access and control AFIPS Proc FJCC Vol 29 1966
4
 
5
J McCARTHY Situations, actions and casual laws Memo No 2 Stanford Artificial Intelligence Project Stanford University July 1963
 
6
R QUILLIAN AFIPS Proc SJCC Vol 30 1967
 
7
R F SIMMONS An approach toward answering english questions from text AFIPS Proc FJCC Vol 29 1966
8
 
9
F B THOMPSON English for computer AFIPS Proc FJCC Vol 29 1966
10
11
 
12
J L DARLINGTON Machine methods for improving logical arguments expressed in English Mechanical Translation Vol 8 Nos 3 and 4 pp 41-47 June and October 1965
 
13
J MC CARTHY Programs with common sense Memo No 7 Stanford Artificial Intelligence Project Stanford University September 1963
 
14
B RAPHAEL A computer program which 'understands' AFIPS Proc FJCC Vol 26 1964
 
15
16
 
17
A NEWELL Unpublished seminar talk
18
 
19
A NEWELL J C SHAW H A SIMON Empirical explorations of the logic theory machine: a case study in heuristics Paper presented at the Western Joint Computer Conference Los Angeles February 28 1957
 
20
F BLACK A deductive question-answering system Harvard University Ph D Thesis 1964
 
21
D C COOPER Theorem proving in computers Advances in Programming and Non-Numerical Computation L FOX ed Pergamon Press 1966
 
22
J A ROBINSON A review f automatic theorem-proving American Mathematical Society Symposia on Applied Mathematics XIX 1967 Rice University (to be published
 
23
 
24
KALISH and MONTAGUE Logic: techniques of formal reasoning Harcourt Brace and World 1964
 
25
L WOS et al The unit preference strategy in theorem proving AFIPS Proc FJCC Vol 26 1964
 
26
T P HART A useful algebraic property of Robinson's unification algorithm Memo No 91 AI Project Project MAC MIT 1965
27

CITED BY  32

Collaborative Colleagues:
C. Cordell Green: colleagues
Bertram Raphael: colleagues