Formalizing retrieval goal change by prioritized abduction

  • Authors:
  • Ken Satoh

  • Affiliations:
  • National Institute of Informatics, Tokyo, Japan

  • Venue:
  • IHI'04 Proceedings of the 2004 international conference on Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

When we traverse over the Internet to search information, we sometimes change an object which we are looking for, in other word, change a retrieval goal according to additional information obtained during search. In this paper, we give a formalization of such a goal change by prioritized abduction and extend the method to a “retrieval command adviser”. We assume a chain of logical rules to satisfy a purpose of the retrieval where bottom conditions are retrieval goals represented as abducible propositions. Abducing these retrieval goals leads to accomplishment of the retrieval purpose. Moreover, we introduce another kind of abducible propositions to represent applicability of logical rules. This applicability abducible is attached to a logical rule and used to detect which rules are used. Then, together with priority over these applicability abducibles to express strength of the associated rules, we determine which rules should preferably be applicable and hence we infer the most appropriate retrieval command which is derived from the most preferable rules. If the observed information is changed, then the applicability of rules is changed and according to the applicability abducibles, we change our retrieval goal. We believe that this mechanism explains a retrieval goal change. Then, we extend the method to construct a “retrieval command adviser” which suggests better retrieval command than the initial command given by a user. We translate the above logical rules into another form which is used for predicting a purpose of give a command. When a user give a command then the system predict the purpose of a command using the newly introduced rules and then according to the initial logic rules and priorities, we infer the most appropriate retrieval command.