A path-oriented matrix-based knowledge representation system
- Author:
- Feyock, Stefan
- Published:
- Sep 1, 1993.
- Physical Description:
- 1 electronic document
- Additional Creators:
- Karamouzis, Stamos T.
Online Version
- hdl.handle.net , Connect to this object online.
- Restrictions on Access:
- Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access - Summary:
- Experience has shown that designing a good representation is often the key to turning hard problems into simple ones. Most AI (Artificial Intelligence) search/representation techniques are oriented toward an infinite domain of objects and arbitrary relations among them. In reality much of what needs to be represented in AI can be expressed using a finite domain and unary or binary predicates. Well-known vector- and matrix-based representations can efficiently represent finite domains and unary/binary predicates, and allow effective extraction of path information by generalized transitive closure/path matrix computations. In order to avoid space limitations a set of abstract sparse matrix data types was developed along with a set of operations on them. This representation forms the basis of an intelligent information system for representing and manipulating relational data.
- Other Subject(s):
- Collection:
- NASA Technical Reports Server (NTRS) Collection.
- Note:
- Document ID: 19940008592.
Accession ID: 94N13065.
NAS 1.26:4539.
NASA-CR-4539. - Terms of Use and Reproduction:
- No Copyright.
View MARC record | catkey: 15663552