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.
B. J. Garner,
"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