An Extendible Graph Processor For Knowledge Engineering

B. J. Garner; E. Tsui

doi:10.1117/12.964157

26 March 1986 An Extendible Graph Processor For Knowledge Engineering

B. J. Garner, E. Tsui

Proceedings Volume 0635, Applications of Artificial Intelligence III; (1986) https://doi.org/10.1117/12.964157
Event: 1986 Technical Symposium Southeast, 1986, Orlando, United States

Abstract

The theory of conceptual graphs offers a uniform and powerful knowledge representation formalism, and an extendible graph processor has been implemented to process domain dependent knowledge that is encoded in canonical graphs. Functional components in the extendible graph processor are described. The language PROLOG is used to implement canonical graphs and the processing tools of the extendible graph processor. Applications of the conceptual graph model are highlighted with a detailed example of schema/script processing.

Citation Download Citation

B. J. Garner and E. Tsui "An Extendible Graph Processor For Knowledge Engineering", Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); https://doi.org/10.1117/12.964157

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available