## Theorem-proving by resolution as a basis for question-answering systems, in (1969)

Venue: | Machine Intelligence, B. Meltzer and D. Michie, eds |

Citations: | 44 - 0 self |

### BibTeX

@ARTICLE{Green69theorem-provingby,

author = {Cordell Green},

title = {Theorem-proving by resolution as a basis for question-answering systems, in},

journal = {Machine Intelligence, B. Meltzer and D. Michie, eds},

year = {1969},

pages = {183--205}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper shows how a question-answering system can be constructed using first-order logic as its language and a resolution-type theorem-prover as its deductive mechanism. A working computer program, qa3, based on these ideas is described. The performance of the program compares favorably with several other general question-answering systems. 1. QUESTION ANSWERING A question-answering system accepts information about some subject areas and answers questions by utilizing this information. The type of question-answering system considered in this paper is ideally one having the following features: 1. A language general enough to describe any reasonable question-answering subjects and express desired questions and answers. 2. The ability to search efficiently the stored information and recognize items that are relevant to a particular query. 3. The ability to derive an answer that is not stored explicitly, but that is derivable by the use of moderate effort from the stored facts.

### Citations

1585 | Some philosophical problems from the standpoint of articial intelligence - McCarthy, Hayes - 1969 |

977 |
A machine-oriented logic based on the resolution principle
- Robinson
- 1965
(Show Context)
Citation Context ...e theorem-proving method used is theoretically complete, in practice its ability to find proofs is limited by the availabiiity of computer time and storage space. However, the method of ‘Resolution’ (=-=Robinson 1965-=-), used by the program described here, has been developed to the point of having several good heuristics. Further improvements in theorem-proving are very likely, and, hopefully, the improvements will... |

27 | The unit preference strategy in theorem proving - Wos, Carson, et al. - 1964 |

25 |
The use of theorem-proving techniques in questionanswering systems
- Green, Raphael
- 1968
(Show Context)
Citation Context ...te deductive systems, even in the practical sense of being unable to answer some simple types of questions that are short, reasonable deductions from the stored facts – for example, the author’s qa1 (=-=Green and Raphael 1968-=-), Raphael’s sir (1964), Slagle’s deducom (1965), and Safier’s simple simon (1965). (However, the fact that we use a first-order logic theorem-prover does impose certain important restrictions discuss... |

21 | Inferential memory as the basis of machines which understand natural language - Lindsay |

17 | A Computer Program for Semantic Information Retrieval - Raphael - 1968 |

13 | Experiment with a heuristic compiler - Simon - 1963 |

9 |
An On-Line Question-Answering System with Natural Language and Pictorial Input
- Coles
- 1968
(Show Context)
Citation Context ...rgues the case for formal methods to achieve such a system and presents one particular approach in detail. A natural language facility is not one of the properties sought after or discussed (although =-=Coles, 1968-=-, has added to the program described here a translator from a subset of English to first-order logic). The name ‘question-answering system’ requires clarification. The system described above might be ... |

8 | A deductive question-answering system - Black - 1968 |

8 | A computer program which "understands - Raphael |

7 | Efficiency and completeness of the set-ofsupport strategy in theorem proving - Wos, Carson, et al. - 1965 |

6 | Fact Retrieval and Deductive Question Answering Information Retrieval Systems - Cooper - 1964 |

5 | Situations, actions and causal laws. Stanford Arti cial Intelligence Project: Memo 2 - McCarthy - 1963 |

4 | baseball: an automatic question answerer. Computers and thought (eds - Green, Wolf, et al. - 1963 |

2 | Eliminating the irrelevant from mechanical proofs. Annual symposia in applied mathematics XIX - Davis - 1963 |

2 | A useful algebraic property of Robinson's Unification Algorithm - Hart - 1965 |

2 | Programs with common sense. Symposium mechanization of thought processes - McCarthy - 1958 |

2 |
A review of automatic theorem-proving. Annual symposia in applied mathematics XIX
- Robinson
- 1967
(Show Context)
Citation Context ...f S, i.e., a copy of S with the free variables renamed. Let the free variables be renamed in such a way that no two variants Si and Sj have variables in common. By the Skolem-Löwenheim-Gödel theorem (=-=Robinson 1967-=-), S is unsatisfiable if and only if there exists an instance of a finite conjunction of variants of S that is truth-functionally unsatisfiable. A resolution theorem prover can be interpreted as provi... |

2 | The Mikado as an advice taker problem. Stanford artificial intelligence project memorandum - Safier - 1963 |

2 | Simple Simon. Stanford artificial intelligence project memorandum - Safier - 1965 |

1 | Theorem proving in computers, Advances in programming and nonnumerical computation - Cooper - 1966 |