By Topic

A path-oriented matrix-based knowledge representation system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Feyock, S. ; Dept. of Comput. Sci., Coll. of William & Mary, Williamsburg, VA, USA ; Karamouzis, S.T.

Most AI 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 in this approach, 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 tool for representing and manipulating relational data. The tool is being used in developing a system that helps flight crews cope with in-flight malfunctions

Published in:

Tools with Artificial Intelligence, 1992. TAI '92, Proceedings., Fourth International Conference on

Date of Conference:

10-13 Nov 1992