Logic and Computational Complexity for Boolean Information Retrieval

Abstract

We study the complexity of query satisfiability and entailment for the Boolean information retrieval models WP and AWV using techniques from propositional logic and computational complexity. WP and AWV can be used to represent and query textual information under the Boolean model using the concept of attribute with values of type text, the concept of word, and word proximity constraints. Variations of WP and AWP are in use in most deployed digital libraries using the Boolean model, text extenders for relational database systems (e.g., Oracle 10g), search engines, and P2P systems for information retrieval and filtering