Information merge feature allows to automatically and seamlessly fuse many systems into one, which is equivalent to merging several articles into one. Imagine a situation, where two scientists work on different projects. One scientist notices that the topic of another scientist’s project can be useful in solving his problems. He can take both projects and merge them together to see how pieces of information in each project relate to each other.
The principle. Green elements represent scientific statements. Lines that connect these elements indicate relations between these statements. During information merge, all elements and their relations are copied from Diagram1 and Diagram2 into the Final Diagram. However, if the same element exists in both diagrams (in this case it is element B), then only one copy of them is added to the Final Diagram. Thereafter, all relations that pointed into the B and from the B are copied into Final Diagram and connected to the new B. As a result, the Final Diagram has only one element B, which serves as a connection point between A and C. Notice that initially the relationship between A and C was not known, but was identified automatically by information merge. In this way information merge solves the famous ABC problem and discovers new knowledge from previously known knowledge.