Massively Parallel Support for Computationally Effective Recognition Queries

PARKA, a frame-based knowledge representation system implemented on the Connection Machine, provides a representation language consisting of concept descriptions (frames) and binary relations on those descriptions (slots). The system is designed explicitly to provide extremely fast property inheritance inference capabilities. PARKA performs fast “recognition” queries of the form “find all frames satisfying p property constraints” in O(d+p) time-proportional only to the depth, (i, of the knowledge base (KB), and independent of its size. For conjunctive queries of this type, PARKA’ s performance is measured in tenths of a second, even for KBs with 100, 000+ frames, with similar results for timings on the Cyc KB. Because PARKA’ s run-time performance is independent of KB size, it promises to scale up to arbitrarily larger domains. With such run-time performance, we believe PARKA is a contender for the title of “fastest knowledge representation system in the world”.

Authors

• Matthew P. Evett James A. Hendler

Keywords

No keywords are indexed for this paper.