Massively Parallel Knowledge Representation

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations


We piesent a massively parallel representation of transitive relations, emphasizing the subclass relation, 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.

Original languageEnglish (US)
Number of pages8
StatePublished - 1993
Event1993 AAAI Spring Symposium - Palo Alto, United States
Duration: Mar 23 1993Mar 25 1993


Conference1993 AAAI Spring Symposium
Country/TerritoryUnited States
CityPalo Alto

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence


Dive into the research topics of 'Massively Parallel Knowledge Representation'. Together they form a unique fingerprint.

Cite this