A knowledge graph reasoning engine data processing method based on logical reasoning
Through the logical reasoning method, the logical path features and cross-correlation of the knowledge graph are obtained, and the problems of complex inference tasks and data errors in traditional methods are solved, achieving high accuracy and high efficiency data processing.
Patent Information
- Application Number
- CN202411073804.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-07
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-08-07
AI Technical Summary
Traditional knowledge graph query and inference methods cannot effectively handle complex inference tasks, and there are problems of mutual verification errors and data errors between data outputs.
Using a method based on logical reasoning, the logical path features are obtained, the path cross-correlationship and logical reasoning results are calculated, and the reasonable correspondence of knowledge graph data is quickly analyzed and verified by using the forward and reverse correlation relationship of the logical path to make multiple judgments and Iterative processing is output to output cross-decision results to achieve rapid processing.
It significantly improves the stability and accuracy of the results, reduces the operating burden, improves the efficiency of the plan implementation, and can accurately locate abnormalities for backtracking.
Smart Images

Figure CN118606487B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of knowledge graph reasoning engine data processing and verification, and specifically to a knowledge graph reasoning engine data processing method based on logical reasoning. Background Art
[0002] The reasoning engine is a core component in an artificial intelligence system, which is responsible for reasoning and inference based on given knowledge and rules. In the past few decades, with the development of artificial intelligence technology, different types of reasoning engines have gradually emerged. Rule engines and knowledge graph engines are two of the most important types. They each have different advantages and limitations and play different roles in different application scenarios. Among them, knowledge graph is a knowledge representation method that represents the relationship between entities and concepts in the form of a graph. However, traditional knowledge graph query and reasoning methods are usually based on graph traversal or simple query languages, which cannot effectively handle complex reasoning tasks. At the same time, there are also problems such as disordered correspondence or data errors in the mutual verification between existing model data outputs. Summary of the invention
[0003] In view of the shortcomings of the prior art, the present invention provides a knowledge graph reasoning engine data processing method based on logical reasoning, which quickly analyzes the reasonable correspondence between related data by establishing the order and time characteristics of the logical path.
[0004] To achieve the above object, the present invention provides a knowledge graph reasoning engine data processing method based on logical reasoning, comprising:
[0005] S1. Obtain the logical path characteristics of the knowledge graph reasoning engine data to be processed;
[0006] S2. Obtaining the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed by using the logical path characteristics of the knowledge graph reasoning engine data to be processed;
[0007] S3, obtaining the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed based on logical reasoning according to the cross-correlation of the path;
[0008] S4. Obtain the knowledge graph reasoning engine data processing result according to the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
[0009] Preferably, the logical path features of obtaining the knowledge graph reasoning engine data to be processed include:
[0010] S1-1, using the current time as the standard time t;
[0011] S1-2, respectively obtain the starting point data volume and the ending point data volume of the logical path of the knowledge graph reasoning engine data to be processed at the standard time t;
[0012] S1-3, determine whether the starting point data volume and the ending point data volume of the logical path of the knowledge graph reasoning engine data to be processed correspond to each other. If so, use the starting point data volume, the ending point data volume and the knowledge graph reasoning engine logical expression of the logical path of the knowledge graph reasoning engine data to be processed as the logical path feature of the knowledge graph reasoning engine data to be processed, otherwise, execute S1-4;
[0013] S1-4. Determine whether there are non-adjacent connected data points in the logical path of the knowledge graph reasoning engine data to be processed. If so, use the starting point data volume, the ending point data volume, the knowledge graph reasoning engine logical expression and the data volume exchanged with non-adjacent connected data points of the logical path of the knowledge graph reasoning engine data to be processed as the logical path characteristics of the knowledge graph reasoning engine data to be processed. Otherwise, abandon processing.
[0014] Further, obtaining the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed by using the logical path characteristics of the knowledge graph reasoning engine data to be processed includes:
[0015] S2-1, determine whether the logical path of the knowledge graph reasoning engine data to be processed is a one-way execution, if so, execute S2-2, otherwise, execute S2-3;
[0016] S2-2, determine whether there are non-adjacent connected data points in the logical path of the knowledge graph reasoning engine data to be processed. If so, use the knowledge graph reasoning engine logical expression of the logical path characteristics of the knowledge graph reasoning engine data to be processed and the starting point data volume and the ending point data volume to establish a first path state mapping and a second path state mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed; otherwise, use the starting point data volume and the ending point data volume of the logical path characteristics of the knowledge graph reasoning engine data to be processed to establish a third path state mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed;
[0017] S2-3, determine whether there are non-adjacent connection data points in the logical path of the knowledge graph reasoning engine data to be processed, if so, establish path segment independent mappings according to the non-adjacent connection data points of the logical path of the knowledge graph reasoning engine data to be processed as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed, otherwise, independently map the transmission direction of the logical path of the knowledge graph reasoning engine data to be processed according to the transmission direction corresponding to the transmission direction as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed;
[0018] The data sequence of the unidirectional execution as a logic path only has meaning in unidirectional processing.
[0019] Furthermore, the step of establishing path segment independent mappings as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed according to the non-adjacent connection data points of the logical path of the knowledge graph reasoning engine data to be processed includes:
[0020] S2-3-1, using the paragraph path from the starting point of the logical path of the knowledge graph inference engine data to be processed to the non-adjacent connection data point as the first forward paragraph path;
[0021] S2-3-2, using the paragraph path from the non-adjacent connecting data points to the end point of the logical path of the knowledge graph reasoning engine data to be processed as the second forward paragraph path;
[0022] S2-3-3, using the paragraph path from the end point of the logical path of the knowledge graph reasoning engine data to be processed to the non-adjacent connection data point as the first reverse paragraph path;
[0023] S2-3-4, using the paragraph path from the non-adjacent connecting data points to the end point of the logical path of the knowledge graph reasoning engine data to be processed as the second reverse paragraph path;
[0024] S2-3-5, using the first forward paragraph path and the second forward paragraph path to establish a forward path segment-independent mapping;
[0025] S2-3-6, using the first reverse paragraph path and the second reverse paragraph path to establish reverse path segment-independent mapping;
[0026] S2-3-7. Use the forward path segment-independent mapping and the reverse path segment-independent mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed.
[0027] Furthermore, using the first forward paragraph path and the second forward paragraph path to establish a forward path segment-independent mapping includes:
[0028] S2-3-5-1, determine whether the first forward paragraph path and the second forward paragraph path correspond to each other, if so, respectively use the first forward paragraph path, the second forward paragraph path and non-adjacent connection data points to establish a path front forward mapping and a path post forward mapping as forward path segmented independent mapping, otherwise, execute S2-3-5-2;
[0029] S2-3-5-2. Determine whether the actual data volume corresponding to the first forward paragraph path is completely consistent with the actual data volume corresponding to the second forward paragraph path. If so, respectively use the first forward paragraph path, the second forward paragraph path and non-adjacent connection data points to establish a path pre-mapping and a path post-mapping as independent mappings of forward path segments. Otherwise, return to S2-3.
[0030] Furthermore, using the first reverse paragraph path and the second reverse paragraph path to establish reverse path segment-independent mapping includes:
[0031] S2-3-6-1, determine whether the first reverse paragraph path and the second reverse paragraph path correspond to each other, if so, execute S2-3-6-2, otherwise, execute S2-3-6-3;
[0032] S2-3-6-2, determine whether the first reverse paragraph path and the first forward paragraph path, and the second reverse paragraph path and the second forward paragraph path are both corresponding, if so, respectively use the first reverse paragraph path, the second reverse paragraph path and the non-adjacent connection data points to establish a path pre-reverse mapping and a path post-reverse mapping as reverse path segmented independent mappings, otherwise, use the first reverse paragraph path and the corresponding actual data volume to establish a path pre-reverse mapping, use the second reverse paragraph path and the corresponding actual data volume to establish a path post-reverse mapping, and use the path pre-reverse mapping and path post-reverse mapping as reverse path segmented independent mappings;
[0033] S2-3-6-3, determine whether the first reverse paragraph path and the second forward paragraph path completely correspond to each other, if so, execute S2-3-6-4, otherwise, return to S2-3-3;
[0034] S2-3-6-4. Determine whether the second reverse paragraph path completely corresponds to the first forward paragraph path. If so, return to S2-3-6-2; otherwise, abandon the process.
[0035] Furthermore, the logical reasoning results of the logical paths of the knowledge graph reasoning engine data to be processed are obtained based on logical reasoning according to the path cross-correlation, including:
[0036] S3-1, determine whether the path cross-correlation corresponding to the same logical path is linear, if so, execute S3-2, otherwise, obtain the linear path corresponding to the path cross-correlation as the adjacent characteristic path, and execute S3-3;
[0037] S3-2, using the path cross-correlation to obtain the path cross-correlation order feature based on logical reasoning as the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed;
[0038] S3-3. Utilize the adjacent feature path to obtain the cross-correlation order feature of the adjacent feature path based on logical reasoning as the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
[0039] Furthermore, the knowledge graph reasoning engine data processing result obtained according to the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed includes:
[0040] S4-1, using the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed to perform traceability verification processing to obtain the logical path traceability verification result of the knowledge graph reasoning engine data to be processed;
[0041] S4-2. Obtain the knowledge graph reasoning engine data processing result by using the logical path tracing verification result of the knowledge graph reasoning engine data to be processed and the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
[0042] Furthermore, the logical path traceability verification result of the knowledge graph reasoning engine data to be processed is obtained by using the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed, including:
[0043] S4-1-1. When the logical reasoning result exists, determine whether the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed corresponding to the logical reasoning result is completely consistent with the topology of the logical path of the knowledge graph reasoning engine data to be processed. If so, execute S4-1-2. Otherwise, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is abnormal.
[0044] S4-1-2. Determine whether the actual data volume at the time when the logical reasoning result exists corresponds to the actual data volume at the standard time t of the logical path of the knowledge graph reasoning engine data to be processed. If so, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is normal; otherwise, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is abnormal.
[0045] Furthermore, the knowledge graph reasoning engine data processing result is obtained by using the logical path tracing verification result of the knowledge graph reasoning engine data to be processed and the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed, including:
[0046] S4-2-1, determine whether the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is normal, if so, execute S4-2-2, otherwise, the knowledge graph reasoning engine data processing result is abnormal, and output the logical path tracing verification result of the knowledge graph reasoning engine data to be processed;
[0047] S4-2-2, determine whether the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed corresponds to singularity, if so, the knowledge graph reasoning engine data processing result is normal, otherwise, the knowledge graph reasoning engine data processing result is abnormal, and output the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed;
[0048] Among them, the unity is that the logical reasoning results of the logical path of the same knowledge graph reasoning engine data to be processed are all of the same type.
[0049] Compared with the closest prior art, the present invention has the following beneficial effects:
[0050] Based on the positive and negative correlation relationship of the logical path data, multiple judgments and screening are performed, and the situations that do not meet the conditions are iteratively processed in a loop, and the cross-judgment results are output. The cross-judgment results are then used to perform rapid processing of logical reasoning. There is no need to consider issues such as the number of paths corresponding to the cross-judgment results. The results can be quickly obtained and traced back and reviewed again based on the results, and then the final path verification results are output, which significantly improves the stable output and high accuracy of the results. At the same time, the anomalies are accurately located in the loop processing for backtracking processing, which reduces the operating burden and improves the efficiency of the solution implementation. BRIEF DESCRIPTION OF THE DRAWINGS
[0051] Figure 1 It is a flow chart of a knowledge graph reasoning engine data processing method based on logical reasoning provided by the present invention. DETAILED DESCRIPTION
[0052] The specific implementation modes of the present invention will be further described in detail below in conjunction with the accompanying drawings.
[0053] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0054] Embodiment 1:
[0055] The present invention provides a knowledge graph reasoning engine data processing method based on logical reasoning, such as Figure 1 As shown, including:
[0056] S1. Obtain the logical path characteristics of the knowledge graph reasoning engine data to be processed;
[0057] S2. Obtaining the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed by using the logical path characteristics of the knowledge graph reasoning engine data to be processed;
[0058] S3, obtaining the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed based on logical reasoning according to the cross-correlation of the path;
[0059] S4. Obtain the knowledge graph reasoning engine data processing result according to the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
[0060] S1 specifically includes:
[0061] S1-1, using the current time as the standard time t;
[0062] S1-2, respectively obtain the starting point data volume and the ending point data volume of the logical path of the knowledge graph reasoning engine data to be processed at the standard time t;
[0063] S1-3, determine whether the starting point data volume and the ending point data volume of the logical path of the knowledge graph reasoning engine data to be processed correspond to each other. If so, use the starting point data volume, the ending point data volume and the knowledge graph reasoning engine logical expression of the logical path of the knowledge graph reasoning engine data to be processed as the logical path feature of the knowledge graph reasoning engine data to be processed, otherwise, execute S1-4;
[0064] S1-4. Determine whether there are non-adjacent connected data points in the logical path of the knowledge graph reasoning engine data to be processed. If so, use the starting point data volume, the ending point data volume, the knowledge graph reasoning engine logical expression and the data volume exchanged with non-adjacent connected data points of the logical path of the knowledge graph reasoning engine data to be processed as the logical path characteristics of the knowledge graph reasoning engine data to be processed. Otherwise, abandon processing.
[0065] In this embodiment, a knowledge graph reasoning engine data processing method based on logical reasoning is provided, wherein the non-adjacent connected data points are nodes outside the normal logical path, and the nodes are abstract descriptions of the time or position at which the data changes form.
[0066] S2 specifically includes:
[0067] S2-1, determine whether the logical path of the knowledge graph reasoning engine data to be processed is a one-way execution, if so, execute S2-2, otherwise, execute S2-3;
[0068] S2-2, determine whether there are non-adjacent connected data points in the logical path of the knowledge graph reasoning engine data to be processed. If so, use the knowledge graph reasoning engine logical expression of the logical path characteristics of the knowledge graph reasoning engine data to be processed and the starting point data volume and the ending point data volume to establish a first path state mapping and a second path state mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed; otherwise, use the starting point data volume and the ending point data volume of the logical path characteristics of the knowledge graph reasoning engine data to be processed to establish a third path state mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed;
[0069] S2-3, determine whether there are non-adjacent connection data points in the logical path of the knowledge graph reasoning engine data to be processed, if so, establish path segment independent mappings according to the non-adjacent connection data points of the logical path of the knowledge graph reasoning engine data to be processed as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed, otherwise, independently map the transmission direction of the logical path of the knowledge graph reasoning engine data to be processed according to the transmission direction corresponding to the transmission direction as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed;
[0070] The data sequence of the unidirectional execution as a logic path only has meaning in unidirectional processing.
[0071] S2-3 specifically includes:
[0072] S2-3-1, using the paragraph path from the starting point of the logical path of the knowledge graph inference engine data to be processed to the non-adjacent connection data point as the first forward paragraph path;
[0073] S2-3-2, using the paragraph path from the non-adjacent connecting data points to the end point of the logical path of the knowledge graph reasoning engine data to be processed as the second forward paragraph path;
[0074] S2-3-3, using the paragraph path from the end point of the logical path of the knowledge graph reasoning engine data to be processed to the non-adjacent connection data point as the first reverse paragraph path;
[0075] S2-3-4, using the paragraph path from the non-adjacent connecting data points to the end point of the logical path of the knowledge graph reasoning engine data to be processed as the second reverse paragraph path;
[0076] S2-3-5, using the first forward paragraph path and the second forward paragraph path to establish a forward path segment-independent mapping;
[0077] S2-3-6, using the first reverse paragraph path and the second reverse paragraph path to establish reverse path segment-independent mapping;
[0078] S2-3-7. Use the forward path segment-independent mapping and the reverse path segment-independent mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed.
[0079] S2-3-5 specifically includes:
[0080] S2-3-5-1, determine whether the first forward paragraph path and the second forward paragraph path correspond to each other, if so, respectively use the first forward paragraph path, the second forward paragraph path and non-adjacent connection data points to establish a path front forward mapping and a path post forward mapping as forward path segmented independent mapping, otherwise, execute S2-3-5-2;
[0081] S2-3-5-2. Determine whether the actual data volume corresponding to the first forward paragraph path is completely consistent with the actual data volume corresponding to the second forward paragraph path. If so, respectively use the first forward paragraph path, the second forward paragraph path and non-adjacent connection data points to establish a path pre-mapping and a path post-mapping as independent mappings of forward path segments. Otherwise, return to S2-3.
[0082] S2-3-6 specifically includes:
[0083] S2-3-6-1, determine whether the first reverse paragraph path and the second reverse paragraph path correspond to each other, if so, execute S2-3-6-2, otherwise, execute S2-3-6-3;
[0084] S2-3-6-2, determine whether the first reverse paragraph path and the first forward paragraph path, and the second reverse paragraph path and the second forward paragraph path are both corresponding, if so, respectively use the first reverse paragraph path, the second reverse paragraph path and the non-adjacent connection data points to establish a path pre-reverse mapping and a path post-reverse mapping as reverse path segmented independent mappings, otherwise, use the first reverse paragraph path and the corresponding actual data volume to establish a path pre-reverse mapping, use the second reverse paragraph path and the corresponding actual data volume to establish a path post-reverse mapping, and use the path pre-reverse mapping and path post-reverse mapping as reverse path segmented independent mappings;
[0085] S2-3-6-3, determine whether the first reverse paragraph path and the second forward paragraph path completely correspond to each other, if so, execute S2-3-6-4, otherwise, return to S2-3-3;
[0086] S2-3-6-4. Determine whether the second reverse paragraph path completely corresponds to the first forward paragraph path. If so, return to S2-3-6-2; otherwise, abandon the process.
[0087] S3 specifically includes:
[0088] S3-1, determine whether the path cross-correlation corresponding to the same logical path is linear, if so, execute S3-2, otherwise, obtain the linear path corresponding to the path cross-correlation as the adjacent characteristic path, and execute S3-3;
[0089] S3-2, using the path cross-correlation to obtain the path cross-correlation order feature based on logical reasoning as the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed;
[0090] S3-3. Utilize the adjacent feature path to obtain the cross-correlation order feature of the adjacent feature path based on logical reasoning as the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
[0091] S4 specifically includes:
[0092] S4-1, using the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed to perform traceability verification processing to obtain the logical path traceability verification result of the knowledge graph reasoning engine data to be processed;
[0093] S4-2. Obtain the knowledge graph reasoning engine data processing result by using the logical path tracing verification result of the knowledge graph reasoning engine data to be processed and the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
[0094] S4-1 specifically includes:
[0095] S4-1-1. When the logical reasoning result exists, determine whether the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed corresponding to the logical reasoning result is completely consistent with the topology of the logical path of the knowledge graph reasoning engine data to be processed. If so, execute S4-1-2. Otherwise, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is abnormal.
[0096] S4-1-2. Determine whether the actual data volume at the time when the logical reasoning result exists corresponds to the actual data volume at the standard time t of the logical path of the knowledge graph reasoning engine data to be processed. If so, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is normal; otherwise, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is abnormal.
[0097] S4-2 specifically includes:
[0098] S4-2-1, determine whether the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is normal, if so, execute S4-2-2, otherwise, the knowledge graph reasoning engine data processing result is abnormal, and output the logical path tracing verification result of the knowledge graph reasoning engine data to be processed;
[0099] S4-2-2, determine whether the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed corresponds to singularity, if so, the knowledge graph reasoning engine data processing result is normal, otherwise, the knowledge graph reasoning engine data processing result is abnormal, and output the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed;
[0100] Among them, the unity is that the logical reasoning results of the logical path of the same knowledge graph reasoning engine data to be processed are all of the same type.
[0101] In this embodiment, a knowledge graph reasoning engine data processing method based on logical reasoning is provided, and the knowledge graph reasoning engine data involved are all stored in the form of triples of "entity-relationship-entity" or "entity-attribute-attribute value". At the data level of the logical path, its nodes can represent entities, and the path endpoints can be considered as a whole as relationships between entities or attributes of entities.
[0102] It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0103] The present invention is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0104] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0105] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0106] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.
Claims
1. A knowledge graph reasoning engine data processing method based on logical reasoning, characterized in that: include: S1. Obtain the logical path characteristics of the knowledge graph reasoning engine data to be processed; S1-1, using the current time as the standard time t; S1-2, respectively obtain the starting point data volume and the ending point data volume of the logical path of the knowledge graph reasoning engine data to be processed at the standard time t; S1-3, determine whether the starting point data volume and the ending point data volume of the logical path of the knowledge graph reasoning engine data to be processed correspond to each other. If so, use the starting point data volume, the ending point data volume and the knowledge graph reasoning engine logical expression of the logical path of the knowledge graph reasoning engine data to be processed as the logical path feature of the knowledge graph reasoning engine data to be processed, otherwise, execute S1-4; S1-4, determine whether there are non-adjacent connection data points in the logical path of the knowledge graph reasoning engine data to be processed. If so, use the starting point data volume, the ending point data volume, and the exchange data volume of the knowledge graph reasoning engine logical expression and the non-adjacent connection data points of the logical path of the knowledge graph reasoning engine data to be processed as the logical path feature of the knowledge graph reasoning engine data to be processed, otherwise, abandon the processing; S2. Obtaining the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed by using the logical path characteristics of the knowledge graph reasoning engine data to be processed; S2-1, determine whether the logical path of the knowledge graph reasoning engine data to be processed is a one-way execution, if so, execute S2-2, otherwise, execute S2-3; S2-2, determine whether there are non-adjacent connected data points in the logical path of the knowledge graph reasoning engine data to be processed. If so, use the knowledge graph reasoning engine logical expression of the logical path characteristics of the knowledge graph reasoning engine data to be processed and the starting point data volume and the ending point data volume to establish a first path state mapping and a second path state mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed; otherwise, use the starting point data volume and the ending point data volume of the logical path characteristics of the knowledge graph reasoning engine data to be processed to establish a third path state mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed; S2-3, determine whether there are non-adjacent connection data points in the logical path of the knowledge graph reasoning engine data to be processed, if so, establish path segment independent mappings according to the non-adjacent connection data points of the logical path of the knowledge graph reasoning engine data to be processed as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed, otherwise, independently map the transmission direction of the logical path of the knowledge graph reasoning engine data to be processed according to the transmission direction corresponding to the transmission direction as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed; S2-3-1, using the paragraph path from the starting point of the logical path of the knowledge graph inference engine data to be processed to the non-adjacent connection data point as the first forward paragraph path; S2-3-2, using the paragraph path from the non-adjacent connecting data points to the end point of the logical path of the knowledge graph reasoning engine data to be processed as the second forward paragraph path; S2-3-3, using the paragraph path from the end point of the logical path of the knowledge graph reasoning engine data to be processed to the non-adjacent connection data point as the first reverse paragraph path; S2-3-4, using the paragraph path from the non-adjacent connecting data points to the end point of the logical path of the knowledge graph reasoning engine data to be processed as the second reverse paragraph path; S2-3-5, using the first forward paragraph path and the second forward paragraph path to establish a forward path segment-independent mapping; S2-3-6, using the first reverse paragraph path and the second reverse paragraph path to establish reverse path segment-independent mapping; S2-3-7, using the forward path segment-independent mapping and the reverse path segment-independent mapping as the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed; The data sequence of the unidirectional execution as a logical path only has meaning when it is processed in one direction; S3, obtaining the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed based on logical reasoning according to the cross-correlation of the path; S3-1, determine whether the path cross-correlation corresponding to the same logical path is linear, if so, execute S3-2, otherwise, obtain the linear path corresponding to the path cross-correlation as the adjacent characteristic path, and execute S3-3; S3-2, using the path cross-correlation to obtain the path cross-correlation order feature based on logical reasoning as the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed; S3-3, using the adjacent feature path to obtain the adjacent feature path cross-correlation order feature based on logical reasoning as the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed; S4, obtaining a knowledge graph reasoning engine data processing result according to the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed; S4-1, using the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed to perform traceability verification processing to obtain the logical path traceability verification result of the knowledge graph reasoning engine data to be processed; S4-2. Obtain the knowledge graph reasoning engine data processing result by using the logical path tracing verification result of the knowledge graph reasoning engine data to be processed and the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed.
2. A knowledge graph inference engine data processing method based on logical reasoning as claimed in claim 1, characterized in that: Using the first forward paragraph path and the second forward paragraph path to establish a forward path segment-independent mapping includes: S2-3-5-1, determine whether the first forward paragraph path and the second forward paragraph path correspond to each other, if so, respectively use the first forward paragraph path, the second forward paragraph path and non-adjacent connection data points to establish a path front forward mapping and a path post forward mapping as forward path segmented independent mapping, otherwise, execute S2-3-5-2; S2-3-5-2. Determine whether the actual data volume corresponding to the first forward paragraph path is completely consistent with the actual data volume corresponding to the second forward paragraph path. If so, respectively use the first forward paragraph path, the second forward paragraph path and non-adjacent connection data points to establish a path pre-mapping and a path post-mapping as independent mappings of forward path segments. Otherwise, return to S2-3.
3. A knowledge graph inference engine data processing method based on logical reasoning as claimed in claim 2, characterized in that: Using the first reverse paragraph path and the second reverse paragraph path to establish reverse path segment independent mapping includes: S2-3-6-1, determine whether the first reverse paragraph path and the second reverse paragraph path correspond to each other, if so, execute S2-3-6-2, otherwise, execute S2-3-6-3; S2-3-6-2, determine whether the first reverse paragraph path and the first forward paragraph path, and the second reverse paragraph path and the second forward paragraph path are both corresponding, if so, respectively use the first reverse paragraph path, the second reverse paragraph path and the non-adjacent connection data points to establish a path pre-reverse mapping and a path post-reverse mapping as reverse path segmented independent mappings, otherwise, use the first reverse paragraph path and the corresponding actual data volume to establish a path pre-reverse mapping, use the second reverse paragraph path and the corresponding actual data volume to establish a path post-reverse mapping, and use the path pre-reverse mapping and path post-reverse mapping as reverse path segmented independent mappings; S2-3-6-3, determine whether the first reverse paragraph path and the second forward paragraph path completely correspond to each other, if so, execute S2-3-6-4, otherwise, return to S2-3-3; S2-3-6-4. Determine whether the second reverse paragraph path completely corresponds to the first forward paragraph path. If so, return to S2-3-6-2; otherwise, abandon the process.
4. A knowledge graph inference engine data processing method based on logical reasoning as claimed in claim 1, characterized in that: The logical path traceability verification result of the knowledge graph reasoning engine data to be processed obtained by using the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed includes: S4-1-1. When the logical reasoning result exists, determine whether the path cross-correlation of the logical path of the knowledge graph reasoning engine data to be processed corresponding to the logical reasoning result is completely consistent with the topology of the logical path of the knowledge graph reasoning engine data to be processed. If so, execute S4-1-2. Otherwise, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is abnormal. S4-1-2. Determine whether the actual data volume at the time when the logical reasoning result exists corresponds to the actual data volume at the standard time t of the logical path of the knowledge graph reasoning engine data to be processed. If so, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is normal; otherwise, the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is abnormal.
5. A knowledge graph inference engine data processing method based on logical reasoning as claimed in claim 1, characterized in that: The knowledge graph reasoning engine data processing result is obtained by using the logical path tracing verification result of the knowledge graph reasoning engine data to be processed and the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed, including: S4-2-1, determine whether the logical path tracing verification result of the knowledge graph reasoning engine data to be processed is normal, if so, execute S4-2-2, otherwise, the knowledge graph reasoning engine data processing result is abnormal, and output the logical path tracing verification result of the knowledge graph reasoning engine data to be processed; S4-2-2, determine whether the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed corresponds to singularity, if so, the knowledge graph reasoning engine data processing result is normal, otherwise, the knowledge graph reasoning engine data processing result is abnormal, and output the logical reasoning result of the logical path of the knowledge graph reasoning engine data to be processed; Among them, the unity is that the logical reasoning results of the logical path of the same knowledge graph reasoning engine data to be processed are all of the same type.
Citation Information
Cited By
Semantic depth proofreading and man-machine rechecking method and system based on large model and knowledge graph traceability
CN121189337A
Semantic deep proofreading and man-machine review method and system based on large model and knowledge graph tracing
CN121189337B
Pattern database intelligent reasoning method and system based on pattern perception
CN121560884A
Pattern perception-based graph database intelligent inference method and system
CN121560884B
