Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3359))

  • 304 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amati, G., Georgatos: Relevance as Deduction: A Logical View of Information Retrieval. In: Proc. of the Second Workshop on Information Retrieval, Uncertainty and Logic (WIRUL 1996), pp. 21–26 (1996)

    Google Scholar 

  2. Bruza, P., Huibers, T.W.C.: A Study of Aboutness in Information Retrieval. Artificial Intelligence Review 10(5-6), 381–407 (1996)

    Article  MATH  Google Scholar 

  3. Bruza, P.D., van Linder, B.: Preferential Models of Query by Navigation. In: Crestani, F., Lalmas, M., van Rijsbergen, C.J. (eds.) Information Retrieval: Uncertainty and Logics, pp. 73–96. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  4. Hunter, A.: Intelligent Text Handling Using Default Logic. In: Proc. of the Eighth IEEE International Conference on Tools with Artificial Intelligence (TAI 1996), pp. 34–40 (1996)

    Google Scholar 

  5. Kakas, A.C., Mancarella, P.: Generalized Stable Models: A Semantics for Abduction. In: Proc. of ECAI 1990, pp. 385–391 (1990)

    Google Scholar 

  6. Kakas, A.C., Kowalski, R., Toni, F.: The Role of Abduction in Logic Programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)

    Google Scholar 

  7. Kowalski, R., Satoh, K.: Goals in Information Seeking, Research Note, Meme Media laboratory, Hokkaido University (2000)

    Google Scholar 

  8. Lau, R., ter Hofstede, A.H.M., Bruza, P.D.: A Study of Belief Revision in the Context of Adaptive Information Filtering. In: Hui, L.C.K., Lee, D.-L. (eds.) ICSC 1999. LNCS, vol. 1749, pp. 1–10. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Lifschitz, V.: Computing Circumscription. In: Proc. of IJCAI 1985, pp. 121–127 (1985)

    Google Scholar 

  10. McCarthy, J.: Application of Circumscription to Formalizing Common-sense Knowledge. Artificial Intelligence 28, 89–116 (1986)

    Article  MathSciNet  Google Scholar 

  11. Sakama, C., Inoue, K.: Representing Priorities in Logic Programs. In: Proceedings of JICSLP 1996, pp. 82–96 (1996)

    Google Scholar 

  12. Satoh, K., Iwayama, N.: A Query Evaluation Method for Abductive Logic Programming. In: Proceedings of JICSLP 1992, pp. 671–685 (1992)

    Google Scholar 

  13. Satoh, K.: Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report. In: Klusch, M., Omicini, A., Ossowski, S., Laamanen, H. (eds.) CIA 2003. LNCS (LNAI), vol. 2782, pp. 324–335. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Shoji, H., Mori, M., Hori, K.: Concept Articulation as Chance Discovery by Shoppers. In: Proc. of PRICAI Workshop on Chance Discovery, pp. 103–114 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Satoh, K. (2005). Formalizing Retrieval Goal Change by Prioritized Abduction. In: Grieser, G., Tanaka, Y. (eds) Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets. Lecture Notes in Computer Science(), vol 3359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32279-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32279-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24465-3

  • Online ISBN: 978-3-540-32279-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics