Polynomial Algorithms for Projection and Matching (original) (raw)

Proceedings of the 7th Annual Workshop on Conceptual Structures Theory and Implementation, 1992

Abstract

The main purpose of this paper is to develop polynomial algorithms for the projection and matching operations on conceptual graphs. Since all interesting problems related to these operations are at least NP-complete — we will consider here the exhibition of a solution and counting the solutions — we propose to explore polynomial cases by restricting the form of the graphs

Michel Chein hasn't uploaded this paper.

Let Michel know you want this paper to be uploaded.

Ask for this paper to be uploaded.