Using a Belief Revision Operator for Document Ranking in. Extended Boolean Models

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 prepositional logic, we propose a similarity measure which is equivalent to a P-Norm case. Therefore it shares the PNorm good properties and behaviour. Besides, it is theoretically ensured that this measure follows the notion of proximity between the documents and the query. The logical model can naturally deal with incomplete descriptions of documents and the similarity values are also obtained for this case.