Using a belief revision operator for document ranking in extended Boolean models

Abstract

This paper claims that Belief Revision can be seen as a theoretical framework for document ranking in Extended Boolean Models. For a model of Information Retrieval based on propositional logic, we propose a similarity measure which is equivalent to a P-Norm case. Therefore it shares the P-Norm good properties and behaviour. Besides, it is theoretically ensured that this measure follows the notion of proximity b e t ween the documents and the query. The logical model can naturally deal with incomplete descriptions of documents and the similarity v alues are also obtained for this case.