Skip to main content
Article thumbnail
Location of Repository

A combinatorial approach to conceptual graph projection checking

By Madalina Croitoru and Ernesto Compatangelo

Abstract

We exploit the combinatorial structure of conceptual graphs in order to obtain better execution times 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.

Publisher: Springer
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.3855
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.csd.abdn.ac.uk/~eco... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.