SET THEORETIC MODELS FOR CLASSIFICATION AND RETRIEVAL,

Abstract

The appropriateness of lattice models as analogues of classification and retrieval systems is analyzed. Models considered include simple distributive lattices, and implicative and subtractive lattices. A particular topological model is also considered. It is shown that any set of topological axioms will be reducible to a Boolean algebra when applied to finite spaces. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1964
Accession Number
AD0609179

Entities

People

  • Alfred G. Dale
  • Richard Jernigan

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Analogs
  • Boolean Algebra
  • Classification
  • Logic

Fields of Study

  • Mathematics

Readers

  • Artificial Intelligence
  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space