A combinatorial approach to conceptual graph projection checking

We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relation over conceptual graphs. We show how the problem of finding this relation can be translated into the Maximum Clique problem. Consequently, approximation techniques developed for the Maximum Clique problem can be used to compute projection in conceptual graphs. We show that there are “simple queries” which can be answered quickly, thus providing efficient reasoning support in a knowledge management environment based on conceptual graphs.

• Type: Conference
• Year: 2004
• Where: SGAI
• Authors: Madalina Croitoru, Ernesto Compatangelo
• Keywords: Conceptual Graphs, Core Generalisation-specialisation Relation, Maximum Clique Problem, SGAI 2004