Proceedings Paper
An Extendible Graph Processor For Knowledge Engineering| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper 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.
Paper Details
Date Published: 26 March 1986
PDF: 19 pages
Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); doi: 10.1117/12.964157
Published in SPIE Proceedings Vol. 0635:
Applications of Artificial Intelligence III
John F. Gilmore, Editor(s)
PDF: 19 pages
Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); doi: 10.1117/12.964157
Show Author Affiliations
B. J. Garner, Deakin University (Australia)
E. Tsui, Deakin University (Australia)
Published in SPIE Proceedings Vol. 0635:
Applications of Artificial Intelligence III
John F. Gilmore, Editor(s)
© SPIE. Terms of Use
