Massively Parallel Knowledge Representation

Document Type

Conference Proceeding

Publication Date

1-1-1993

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.

Identifier

77957042425 (Scopus)

Publication Title

Aaai Spring Symposium Technical Report

First Page

90

Last Page

97

Volume

SS-93-04

Grant

F306002-88-C-0031

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS