Massively Parallel Knowledge Representation

James Geller

Massively Parallel Knowledge Representation

Research output: Contribution to conference › Paper › peer-review

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

Cite this

@conference{0c6fcf86b1a74cb0a4ab927068c25a31,

title = "Massively Parallel Knowledge Representation",

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.",

author = "James Geller",

year = "1993",

language = "English (US)",

pages = "90--97",

}

TY - CONF

T1 - Massively Parallel Knowledge Representation

AU - Geller, James

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77957042425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957042425&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:77957042425

SP - 90

EP - 97

T2 - 1993 AAAI Spring Symposium

Y2 - 23 March 1993 through 25 March 1993

ER -

Massively Parallel Knowledge Representation

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this