Frisch, A.M.; Allen, J.F.: Knowledge retrieval as limited inference (1982)
0.01
0.008167865 = product of:
0.01633573 = sum of:
0.01633573 = product of:
0.03267146 = sum of:
0.03267146 = weight(_text_:systems in 5804) [ClassicSimilarity], result of:
0.03267146 = score(doc=5804,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.2037246 = fieldWeight in 5804, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=5804)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Artificial intelligence reasoning systems commonly employ a knowledge base module that stores a set of facts expressed in a representation language and provides facilities to retrieve these facts. A retriever could range from a simple pattern matcher to a complete logical inference system. In practice, most fall in between these extremes, providing some forms of inference but not others. Unfortunately, most of these retrievers are not precisely defined. We view knowledge retrieval as a limited form of inference operating on the stored facts. This paper is concerned with our method of using first-order predicate calculus to formally specify a limited inference mechanism and to a lesser extent with the techniques for producing an efficient program that meets the specification. Our ideas are illustrated by developing a simplified version of a retriever used in the knowledge base of the Rochester Dialog System. The interesting property of this retriever is that it perlorms typical semantic network inferences such as inheritance but not arbitrary logical inferences such as modus ponens.
