26 March 1986 An Extendible Graph Processor For Knowledge Engineering
Author Affiliations +
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
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.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
B. J. Garner, B. J. Garner, E. Tsui, E. Tsui, } "An Extendible Graph Processor For Knowledge Engineering", Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); doi: 10.1117/12.964157; https://doi.org/10.1117/12.964157


MAGIK : A System For Hydrocarbon Play Analysis
Proceedings of SPIE (March 28 1988)
Symbolic planning with metric time
Proceedings of SPIE (February 29 1992)
Adaptive Planning For Threat Response
Proceedings of SPIE (March 20 1989)
Software Reusability In A Knowledge-Based Environment
Proceedings of SPIE (March 20 1989)
KEShell a "rule skeleton + rule body" based...
Proceedings of SPIE (February 28 1991)

Back to Top