Revisiting Exhaustivity and Specificity Using Propositional Logic and Lattice Theory

  • Authors:
  • Karam Abdulahhad;Jean-Pierre Chevallet;Catherine Berrut

  • Affiliations:
  • Université de Grenoble, LIG laboratory, MRIM group, Grenoble, France;UPMF-Grenoble 2, LIG laboratory, MRIM group, Grenoble, France;UJF-Grenoble 1, LIG laboratory, MRIM group, Grenoble, France

  • Venue:
  • Proceedings of the 2013 Conference on the Theory of Information Retrieval
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Exhaustivity and Specificity in logical Information Retrieval framework were introduced by Nie [16]. However, even with some attempts, they are still theoretical notions without a clear idea of how to be implemented. In this study, we present a new approach to deal with them. We use propositional logic and lattice theory in order to redefine the two implications and their uncertainty P(d → q) and P(q → d). We also show how to integrate the two notions into a concrete IR model for building a new effective model. Our proposal is validated against six corpora, and using two types of terms (words and concepts). The experimental results showed the validity of our viewpoint, which state: the explicit integration of Exhaustivity and Specificity into IR models will improve the retrieval performance of these models. Moreover, there should be a type of balance between the two notions.