A Simulation of Co-identity with Rules in Simple and Nested Graphs

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… CONTINUE READING