An information retrieval model that represents queries as Boolean expressions (combinations of AND, OR, NOT over terms) and returns the set of documents that satisfy the logical expression; retrieval is set‑based and, in its pure form, produces unranked results.

Principle

Retrieval under the Boolean model is deterministic and set‑theoretic: a document either satisfies the Boolean expression or it does not; there is no inherent notion of graded relevance unless ranking extensions or post‑processing are applied.

Demonstration

Illustrative scenario: A user queries “climate AND (policy OR governance) NOT 'opinion'”; the system evaluates the expression and returns all documents containing 'climate' and either 'policy' or 'governance' while excluding those indexed with 'opinion', producing an unranked result set that precisely matches the logical constraints.

Misapplication

Expecting the Boolean model to provide ranked, best‑match results (for example, interpreting OR matches as partial relevance rankings) is a category error: pure Boolean retrieval is a filter, not a scoring model; perceived relevance ordering requires additional mechanisms.

Consequence

Boolean retrieval gives precise control over inclusion and exclusion, useful for narrow, high‑precision queries and complex logical filters; however it is brittle to vocabulary mismatch and often returns either too many or zero results without relevance ordering.

Reversal

Extensions that add term weighting, scoring or hybrid Boolean‑ranked approaches can introduce graded relevance while preserving logical constraints; alternatively, when partial matching and ranking are the goal, vector or probabilistic models are typically preferred.

Boundary

Clearly within: exact Boolean queries evaluated as logical expressions producing an unranked set. Boundary case: ranked Boolean systems that combine Boolean filtering with subsequent scoring. Clearly outside: models that inherently produce continuous relevance scores (VSM, probabilistic and neural ranking models).

Semantic Tension

Precision ↔ Recall — Boolean logic provides exact precision for queries that map well to the user’s terms but often sacrifices recall when lexical variation or conceptual mismatch occurs; resolving this tension requires controlled vocabularies, synonyms or query expansion.

Synthesis

The Boolean model is deterministic filtering: it excels at precise logical inclusion/exclusion but offers no built‑in notion of degree of match, making it complementary to, rather than a substitute for, graded ranking models.