论文信息 - Conceptual graphs: fundamental notions

Conceptual graphs: fundamental notions

Nous definissons precisement les notions de base du modele des graphes conceptuels de Sowa [Sowa 84] et en etudions les proprietes. Nos resultats portent principalement sur la structure de la relation de specialisation, la correspondance entre operations de graphes et operations logiques, et la complexite algorithmique de la mise en œuvre du modele

M. Chein | M. Mugnier

[1] Steven W. Reyner,et al. An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Robert M. Haralick,et al. Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4] John F. Sowa,et al. Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[5] Marie-Claude Landau,et al. Conceptual Graphs for Semantics and Knowledge Processing , 1986, IBM J. Res. Dev..

[6] M. K. Jackman,et al. Inference and the conceptual graph knowledge representation language , 1988 .

[7] J. Sowa. On conceptual structures: A response to the review by S.W. Smoliar , 1988 .

[8] Marie-Laure Mugnier,et al. Polynomial Algorithms for Projection and Matching , 1992, Workshop on Conceptual Graphs.

[9] John F. Sowa,et al. Conceptual graphs as a universal knowledge representation , 1992 .

[10] Gerard Ellis,et al. Compiled hierarchical retrieval , 1992 .

[11] Peter W. Eklund,et al. Conceptual structures: current research and practice , 1992 .

[12] Marie-Laure Mugnier. Contributions algorithmiques pour les graphes d'héritage et les graphes conceptuels , 1992 .

[13] David Haussler,et al. Learning Conjunctive Concepts in Structural Domains , 1989, Machine Learning.