Use of an infinite-valued propositional calculus in a document retrieval system

Authors:
John R. Miller
Affiliations:
-
Venue:
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Year:
1978

Citing 3
Cited 0

On Relevance, Probabilistic Indexing and Information Retrieval

Journal of the ACM (JACM)
Automatic Information Organization and Retrieval.

Automatic Information Organization and Retrieval.
The SMART Retrieval System—Experiments in Automatic Document Processing

The SMART Retrieval System—Experiments in Automatic Document Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is proposed that a particular infinite-valued propositional calculus be used to define a retrieval function for a document retrieval system in which queries are well-formed formulas of the propositional calculus. With this approach, “weighted” queries may be processed in a simple, straightforward manner; queries may be represented as highly sparse vectors, and this representation may be transformed easily into the more conventional truth-table representation, and conversely; feedback techniques may be used; and a means is provided for circumventing the “independence assumption” with regard to subject identifiers.