Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Computational Situation Theory in the Conceptual Graph Language
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
Sound and Complete Forward and backward Chainingd of Graph Rules
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Two FOL Semantics for Simple and Nested Conceptual Graphs
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
A Pure Graph-Based Solution to the SCG-1 Initiative
ICCS '99 Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
The Advent of Formal Diagrammatic Reasoning Systems
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
| Hi-index | 0.00 |
Equality of markers ajid 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.