AI topics Explore related entries. Larger tags appear on more entries.
Reasoning Logic Memory Recall Knowledge representation The contribution QA1 placed facts and logical relationships in list-structured memory and used inference rules to derive answers. QA2 put a formal resolution theorem prover at the center of the question-answering system. The paper separated finding relevant information from deriving new answers, and explored how changing knowledge could avoid rewriting dedicated answering routines.
What this does not establish These were early experimental systems using formal representations and limited examples. Their logical deductions did not establish unrestricted understanding of natural language.
Why this date? 1968 is the conference publication year shown in the original paper. SHRDLU reference 20 uses the label Green 1969b but identifies the 1968 proceedings.
This entry follows the linked publication. Read the source and date conventions.
The original work The Use of Theorem-Proving Techniques in Question-Answering Systems
Authors C. Cordell Green and Bertram Raphael Publication ACM National Conference, 169-181 Source type Conference paper The links above support the description and dating of this entry. Full text may be open or publisher-restricted.
Cited By Atlas entries whose reference lists cite this work or the publication version noted below.
Citations Works and systems referenced by this entry. Related publications are identified below.
Bibliography coverage: Reference section indexed. Open the source .
Reference text retains scan, spelling, line-break and column-order artifacts. Matching does not rely on publication year alone.
Read the indexed bibliography Bibliography (PDF pages 12, 13) 1 R F SIMMONS Answering english questions by computer: a survey Comm ACM Vol 8 No 1 January 1965
2 K M COLBY H ENEA Heuristic methods for computer understanding of na ural language in context-restricted on-line dialogu~ Dept of Computer Sciences Stanford University 196
The Use of Theorem-Proving Techniques in Question-Answering Systems 181
3 J A CRAIG et al DEACON: direct english access and control AFIPS Proc FJCC Vol 29 1966
4 R E LEVIEN M E MARON A computer system for inference, execution and data retrieval Comm ACM Vol 10 No 11 pp 715-721 November 1967
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 J R SLAGLE Experiments with a deductive Q-A program Comm ACM Vol 8 No 12 December 1965
9 F B THOMPSON English for computer AFIPS Proc FJCC Vol 29
1966
10 J W WEIZENBAUM ELIZA---a computer program for the study of natural language communication between man and machine Comm ACM Vol 9 No 1 January 1966
11 L S COLES An on-line question-answering system with natural language and pictorial input (Paper to be presented at the ACM Conference August 1968)
12 J L D A R L I N G T O N 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 B RAPHAEL SIR: A computer program for semantic information retrieval MAC-TR2 Project MAC MIT June 1964
16 J A ROBINSON A machine-oriented logic based on the resolution principle
J ACM Vol 12 No 1 January 1965
17 A NEWELL Unpublished seminar talk
18 B RAPHAEL Aspects and applications of symbol manipulation Proc 1966 National Conference ACM 1966
19 A NEWELL J C S H A W 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 Adances in Programming and Non-Numerical Computation L FOX ed Pergamon Press 1966
22 J A ROBINSON A review of automatic theorem-proving American Mathematical Society Symposia on Applied Mathematics XIX 1967 Rice University (to be published
23 E MENDELSON Introduction to mathematical logic van Nostrand 1964
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 J R SLAGLE Automatic theorem-proving with renameable and semantic resolution J ACM Vol 14 No 4 October 1967
Download the bibliography index · Download Atlas citation links
These links cover verified matches within the Atlas. They are not total scholarly citation counts. A citation alone does not establish that the later system implements the same method.
Comments
Discuss this research, ask a question, or suggest a correction. Comments appear after the site owner approves them.
Moderate comments
Loading comments…
Sign in with ChatGPT to comment
Use your OpenAI account. Published comments show the display name you choose, not your account email.