Method and system for merging data or information

A system allowing merging of information of high semantic level representing complex situations comprising several objects or data originating from several sensors, the system comprising:

• several sensors configured to observe information and inputs;
• a knowledge base comprising elements characteristic of a merging application and configured for application of a merging strategy;
• an information base storing all of the information or data arising from the several sensors;
• a processor configured to:
• acquire the information or data arising from the several sensors in raw form and transform the several items of information or data to cast the several items of information or data into a form of conceptual graphs, a conceptual graph representing several concepts and relations which exist between the several concepts, a conceptual graph comprising several entity nodes and relation nodes, with a set of concept nodes E defined on a support S, two conceptual graphs G1 and G2 defined on the support S, and the two conceptual graphs G1 and G2 being stored in a database;
• define a knowledge base containing information or data specific to a sector of an application of data merging and rules applied in said sector of the application, and transform said information or data specific to the sector of the application to present said information or data specific to the sector of the application in a form of conceptual graphs;
• determine a merging strategy denoted strategymerge as follows:
• strategymerge=fmerge◯fcomp:E×E→E∪{E×E}, where fmerge:{true, false}×E×E→E∪{E×E} is a merge function for merging concept nodes of graphs, and fcomp:
• E×E{true, false} ×E×E is a function for testing compatibility between two concept nodes of the graphs;
• apply the merging strategy to the information or data arising from the knowledge base and from an observation base taking the form of graphs to produce merged data;
• and
• at least one output configured to record or display results arising from the merging of the information or data, wherein:
• the two conceptual graphs G1 and G2 have a common generalization H, and
• projections P1:H→G1 and P2:H→G2, P1 and P2 are compatible according to the function fcomp if, for each concept c of the graph H, the following conditions are complied with:
• P1(c) and P2(c) have a common sub-type different from an absurd type, referents or components of P1(c) and P2f c) conform to their most general common sub-type, and
• the referents of P1(c) and P2(c) are either equal, or one of the two is undefined, or fcomp(P1(c), P2(c))=(true, P1(c), P2(c)).