Massively Parallel Knowledge Representation
James Geller · 1993
We present a massively parallel representation of transitive relations, emphasizing the subclass re-lation, which extends our previous linear tree representation of class hierarchies. This representation makes use of a grid of processors and distributes information about one class over the processors of one column of the grid. As such, it can deal with a subset of directed acyclic graphs. We prove that a "node insertion " can be performed efficiently in our representation. 1