Most information retrieval systems are denoted as a set of Horn clauses representing the average user's concept in order to gain solutions which satisfy some predicates about conditions demanded by the user. In this paper, the system prepares the default rules considering general user's requirements in advance. Each user inputs rules representing individual demands sequentially. Both of the rules are matched with each other, and the solution which has the highest value of the certainty factor is derived. The strategy on how we can gain the solution with the minimum number of the questions and answers is investigated based on the certainty factor computed by the minimax rule. The game theoretical framework is established and the optimal question strategy is shown in a minimax criterion. Our scheme has a large merit of applying not only to individual systems but also to general information retrieval systems.
|Number of pages||8|
|Journal||Bulletin of Centre for Informatics (Waseda University)|
|Publication status||Published - 1988 Sep 1|
ASJC Scopus subject areas