Abstract
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 language | English (US) |
---|---|
Pages | 90-97 |
Number of pages | 8 |
State | Published - 1993 |
Event | 1993 AAAI Spring Symposium - Palo Alto, United States Duration: Mar 23 1993 → Mar 25 1993 |
Conference
Conference | 1993 AAAI Spring Symposium |
---|---|
Country/Territory | United States |
City | Palo Alto |
Period | 3/23/93 → 3/25/93 |
All Science Journal Classification (ASJC) codes
- Artificial Intelligence