Abstract
Equality of markers and co-reference links have always been a convenient way to denote that two concept nodes represent the same entity in conceptual graphs. This is the underlying cause of counterexamples to projection completeness with respect to these graphs FOL semantics. Several algorithms and semantics have been proposed to achieve completeness, but they do not always suit an application specific needs. In this paper, I propose to represent identity by relation nodes, which are first-class objects of the model, and I show that conceptual graphs rules can be used to represent and simulate reasonings defined by various semantics assigned to identity, be it in the case of simple or nested graphs. The interest of this method is that we can refine these rules to manage the identity needed by the application.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Chein, M-L. Mugnier, and G. Simonet. Nested Graphs: A Graph-based Knowledge Representation Model with FOL Semantics. In Proceedings of the 6th International Conference “Principles of Knowledge Representation and Reasoning” (KR’98). Morgan Kaufmann Publishers, 1998.
D. Genest and E. Salvat. A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT. In Proceedings of the 6th International Conference on Conceptual Structures, Lecture Notes in AI. Springer, 1998.
B.C. Ghosh and V. Wuvongse. Computational Situation Theory in the Conceptual Graph Language. In Proceedings of ICCS’96, Lecture Notes in AI. Springer, 1996.
M-L. Mugnier and M. Chein. Représenter des connaissances et raisonner avec des graphes. Revue d’Intelligence Artificielle, 10–1:7–56, 1996.
E. Salvat. Raisonner avec des opérations de graphes: graphes conceptuels et règies d’inférence. PhD thesis, Université de Montpellier II, 1997.
E. Salvat and M-L. Mugnier. Sound and Complete Forward and Backward Chainings of Graph Rules. In Proceedings of the 4th International Conference on Conceptual Structures, Lecture Notes in AI. Springer, 1996.
G. Simonet. Une autre sémantique logique pour les graphes conceptuels simples ou emboîtés. Research Report, 1996.
G. Simonet. Une sémantique logique pour les graphes conceptuels emboîtés. Research Report, 1996.
G. Simonet. Two FOL Semantics for Simple and Nested Conceptual Graphs. In Proceedings of the 6th International Conference on Conceptual Structures, Lecture Notes in AI. Springer, 1998.
J. F. Sowa. Conceptual structures: Information processing in mind and machine. Addison-Wesley, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baget, JF. (1999). A Simulation of Co-identity with Rules in Simple and Nested Graphs. In: Tepfenhart, W.M., Cyre, W. (eds) Conceptual Structures: Standards and Practices. ICCS 1999. Lecture Notes in Computer Science(), vol 1640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48659-3_28
Download citation
DOI: https://doi.org/10.1007/3-540-48659-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66223-5
Online ISBN: 978-3-540-48659-6
eBook Packages: Springer Book Archive