5 February 1990 Optical Adjacency Matrix Associative Processor
Author Affiliations +
Abstract
A new bidirectional optical associative processor is described for searching a hierarchical database that is stored as an adjacency matrix. The paper discusses how the processor can answer relatively complex queries on a knowledge base when the queries are formulated as combinations of set closures, unions, intersections, and complementations. Thus, a processor that performs general set operations results, as well as a system that can answer various knowledge base queries and guide a knowledge base search. These are new operations for associative processors that increase their utility. This new associative processor operates on entities and their attributes. It can be viewed as a type lattice processor (since the entities and attributes form a hierarchy known as a type lattice), as a closure processor (since it performs closure operations that list all attributes of an entity [or entities] or all entities with a given attribute [or attributes]), or as an adjacency processor (since the connection matrix used stores adjacent associations of attributes and entities).
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David Casasent, Brian Telfer, "Optical Adjacency Matrix Associative Processor", Proc. SPIE 1151, Optical Information Processing Systems and Architectures, (5 February 1990); doi: 10.1117/12.962242; https://doi.org/10.1117/12.962242
PROCEEDINGS
9 PAGES


SHARE
Back to Top