论文信息 - An Extendible Graph Processor For Knowledge Engineering

An Extendible Graph Processor For Knowledge Engineering

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.

Eric Tsui | Brian J. Garner

[1] Sharon C. Salveter. Inferring Conceptual Graphs , 1979, Cogn. Sci..

[2] Roger C. Schank. The Cognitive Computer: On Language, Learning, and Artificial Intelligence , 1984 .

[3] Tiit Roosmaa,et al. On the Interaction of Knowledge Representation and Reasoning Mechanism in Discourse Comprehension , 1982, ECAI.

[4] Ronald J. Brachman,et al. ON THE EPISTEMOLOGICAL STATUS OF SEMANTIC NETWORKS , 1979 .

[5] Drew McDermott,et al. Introduction to artificial intelligence , 1986, Addison-Wesley series in computer science.

[6] Roger C. Schank,et al. SCRIPTS, PLANS, GOALS, AND UNDERSTANDING , 1988 .

[7] William F. Clocksin,et al. Programming in Prolog , 1987, Springer Berlin Heidelberg.

[8] Eric Tsui,et al. Knowledge Representation for an Audit Office , 1985, Aust. Comput. J..

[9] Marvin Minsky,et al. A framework for representing knowledge , 1974 .

[10] John B. Black,et al. The representation of scripts in memory , 1985 .