CN113742497A - Data processing method and device based on knowledge graph - Google Patents
Data processing method and device based on knowledge graph Download PDFInfo
- Publication number
- CN113742497A CN113742497A CN202111094332.7A CN202111094332A CN113742497A CN 113742497 A CN113742497 A CN 113742497A CN 202111094332 A CN202111094332 A CN 202111094332A CN 113742497 A CN113742497 A CN 113742497A
- Authority
- CN
- China
- Prior art keywords
- task
- project
- map
- tasks
- newly added
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/35—Clustering; Classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/279—Recognition of textual entities
- G06F40/289—Phrasal analysis, e.g. finite state techniques or chunking
- G06F40/295—Named entity recognition
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Computational Linguistics (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Stored Programmes (AREA)
Abstract
The application discloses a data processing method based on a knowledge graph, which can be applied to the financial field or the big data field. When a new task is needed, firstly determining the attribute of the new task, matching the attribute of the new task with the process layout map, determining a target map entity associated with the new task, and further determining the position of the new task to be inserted into the project key path according to the target map entity and the project key path. Wherein, the process arrangement map comprises: the map entities, the association relationship between the map entities, and the attributes of each map entity. The project critical path is the longest path for implementing the project, and is used for characterizing: multiple tasks of a project are implemented, as well as an order of execution between the multiple tasks. Therefore, by the aid of the scheme, the positions of newly added tasks which need to be inserted into the project key paths can be determined automatically according to the process layout map and the project key paths, and research and development efficiency is effectively improved.
Description
Technical Field
The application relates to the field of finance, in particular to a data processing method and device based on a knowledge graph.
Background
Currently, when a research and development staff researches a project, since the project may be composed of a plurality of tasks, the research and development staff needs to research and develop the plurality of tasks and perform flow arrangement on the plurality of tasks, so as to complete the research and development of the project. Wherein: the process arrangement refers to arranging each task to complete a certain project, and each task is orderly woven and aggregated into a specific execution chain. In some scenarios, a "task" may also be referred to as a "job".
However, during the project development process, there is a high possibility that a new task will be added. Currently, when a new task is added in the project research and development process, the research and development efficiency is low, so a scheme is urgently needed to solve the problem.
Disclosure of Invention
The technical problem that this application will solve is: when a new task is added in the project research and development process, the research and development efficiency is low, and a data processing method and a data processing device based on the knowledge graph are provided.
In a first aspect, an embodiment of the present application provides a data processing method based on a knowledge graph, where the method includes:
determining the attribute of the newly added task;
matching the attribute of the newly added task with a process arrangement map, and determining a target map entity associated with the newly added task, wherein the process arrangement map comprises the following steps: the map entities, the incidence relation among the map entities and the attributes of all the map entities;
determining the position of the newly added task which needs to be inserted into a project key path according to the target graph entity and the project key path, wherein the project key path is the longest path for realizing a project, and the project key path is used for representing: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented.
Optionally, the method further includes:
and calculating the project key path according to the flow arrangement map.
Optionally, the project key path includes N tasks, and the calculating the project key path according to the flow arrangement graph includes:
obtaining the project key path through i iterations, wherein each iteration is used for determining one task in the project key path, the maximum value of i is N-1, and the minimum value is 1, and the method comprises the following steps:
when i is equal to 1, the task corresponding to the ith iteration point is the task executed last by the project, and when i is equal to N-1, the task corresponding to the ith iteration point is the task executed first by the project;
and if a plurality of tasks are executed before the ith iteration point corresponds to the task, the task corresponding to the (i + 1) th iteration point is the task with the latest end time in the plurality of tasks.
Optionally, the method further includes:
obtaining a software program that implements at least one task of the project;
and constructing the process arrangement map by using the software program.
Optionally, after the development of the new task is completed, the method further includes:
and updating the process arrangement map by using the software program of the newly added task.
In a second aspect, an embodiment of the present application provides a data processing apparatus based on a knowledge-graph, the apparatus including:
the first determining unit is used for determining the attribute of the newly added task;
a second determining unit, configured to match an attribute of the newly added task with a process layout, and determine a target map entity associated with the newly added task, where the process layout includes: the map entities, the incidence relation among the map entities and the attributes of all the map entities;
a third determining unit, configured to determine, according to the target graph entity and a project key path, a position where the newly added task needs to be inserted into the project key path, where the project key path is a longest path for implementing a project, and the project key path is used to characterize: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented.
Optionally, the apparatus further comprises:
and the calculating unit is used for calculating the project key path according to the flow arrangement map.
Optionally, the project critical path includes N tasks, and the computing unit is configured to:
obtaining the project key path through i iterations, wherein each iteration is used for determining one task in the project key path, the maximum value of i is N-1, and the minimum value is 1, and the method comprises the following steps:
when i is equal to 1, the task corresponding to the ith iteration point is the task executed last by the project, and when i is equal to N-1, the task corresponding to the ith iteration point is the task executed first by the project;
and if a plurality of tasks are executed before the ith iteration point corresponds to the task, the task corresponding to the (i + 1) th iteration point is the task with the latest end time in the plurality of tasks.
Optionally, the apparatus further comprises:
an acquisition unit for acquiring a software program that implements at least one task of the project;
and the construction unit is used for constructing the process arrangement map by utilizing the software program.
Optionally, after the development of the new task is completed, the apparatus further includes:
and the updating unit is used for updating the process arrangement map by using the software program of the newly added task.
Compared with the prior art, the embodiment of the application has the following advantages:
in the embodiment of the application, when a new task is required in a project, the attribute of the new task may be determined first, the attribute of the new task is matched with a flow arrangement map, a target map entity associated with the new task is determined, and further, the position where the new task needs to be inserted into a project key path is determined according to the target map entity and the project key path. Wherein, the process arrangement map comprises: the map entities, the association relationship between the map entities, and the attributes of each map entity. The project critical path is the longest path that implements the project, and is used to characterize: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented. Therefore, by the aid of the method, research personnel do not need to manually calculate the insertion position of the newly added task in the existing project, and the position of the newly added task which needs to be inserted into the project key path can be automatically determined according to the flow layout map and the project key path. Therefore, by the aid of the scheme, research and development efficiency can be effectively improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a schematic flow chart of a data processing method based on knowledge-graph according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a data processing apparatus based on a knowledge graph according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The inventor of the application finds that in the process of project development, the possibility of new tasks is very likely to exist. Currently, when a new task is added in a project research and development process, research and development personnel are required to manually calculate the position of the new task in an existing execution chain, so that the research and development efficiency is low.
In order to solve the above problem, an embodiment of the present application provides a data processing method and apparatus based on a knowledge graph.
Various non-limiting embodiments of the present application are described in detail below with reference to the accompanying drawings.
Exemplary method
Referring to fig. 1, the figure is a schematic flowchart of a data processing method based on a knowledge graph according to an embodiment of the present application. In this embodiment, the method may include, for example, the steps of: S101-S103.
S101: and determining the attribute of the newly added task.
In the embodiment of the present application, the attributes of the newly added task include, but are not limited to: the service (such as banking service) related to the new task, the online interface called by the new task, the precondition for executing the new task, the subsequent operation of the new task, and the like.
S102: matching the attribute of the newly added task with a process arrangement map, and determining a target map entity associated with the newly added task, wherein the process arrangement map comprises the following steps: the map entities, the association relationship between the map entities, and the attributes of each map entity.
In the embodiment of the present application, the flow arrangement map may be constructed in advance. Regarding the way of constructing the process layout map, reference can be made to the relevant description section below, which is not detailed here. The process layout referred to herein may include the graph entities, associations between the graph entities, and attributes of the respective graph entities. One graph entity may correspond to one task, and the relationship between graph entities refers to the relationship between tasks, for example, the execution sequence between tasks, and the parameter association between tasks. For example, the output of task A is the input of task B, and so on. Attributes of the graph entity include, but are not limited to, a service related to the graph entity, an online interface called by the graph entity, preconditions executed by the graph entity, subsequent operations of the graph entity, and the like.
And after the attributes of the newly added task are matched with the process layout, a target map entity associated with the newly added task can be obtained. The new task is associated with the target graph entity, and may be a portion where an attribute of the new task and an attribute of the target graph entity overlap. For example, the precondition for the execution of the target graph entity is the same as the subsequent operation of the newly added task; as another example, the online interface called by the target graph entity is the same as the online interface called by the new task, and so on. Not to be construed as an exhaustive list. It will be appreciated that the target graph entity associated with the added task may comprise one or more graph entities. It can be understood that the relationship between the task corresponding to the target graph entity and the newly added task is relatively close, and the position of the newly added task in the existing execution chain can be further determined according to the execution time of the target graph entity. The existing execution chain refers to the execution sequence of each project which is developed and completed in the project.
S103: determining the position of the newly added task which needs to be inserted into a project key path according to the target graph entity and the project key path, wherein the project key path is the longest path for realizing a project, and the project key path is used for representing: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented.
In the embodiment of the application, after the target graph entity is determined, the position where the new task is to be inserted into the project key path may be further determined according to the project key path. Specifically, the location of the target graph entity in the project key path and the attribute of the newly added task and the attribute of the target graph entity may be determinedAnd determining the position of the newly added task to be inserted into the project critical path. For example, the target graph entity includes a first graph entity and a second graph entity, and, in the project key path: and after the task corresponding to the first map entity is executed, executing the task corresponding to the second map entity. The relationship between the attribute of the newly added task and the attribute of the target map entity is as follows: the subsequent operation of the first map entity is a precondition for the execution of the newly added task, and the subsequent operation of the newly added task is a precondition for the execution of the second map entity. Therefore, the task corresponding to the newly added task in the first map entity can be determined
And executing between tasks corresponding to the second map entity.
According to the above description, by using the scheme, the position of the newly added task inserted into the existing project is not required to be manually calculated by research personnel, and the position of the newly added task inserted into the project key path can be automatically determined according to the flow layout map and the project key path. Therefore, by the aid of the scheme, research and development efficiency can be effectively improved.
It should be noted that, in the embodiment of the present application, the project critical path may be calculated according to a flow layout map.
In one example, the lengths of all paths may be calculated by using a topological sorting manner, and a path corresponding to the maximum length is taken as a project critical path.
But it is contemplated that the path of the entire project may be hundreds of thousands. If each path is computed, the processing efficiency will be very poor. Thus, in yet another example, a set of top tasks that end at the latest point in time may be taken as the project critical path by pushing back to the first executed task of the project starting with the last executed task of the project. Thereby shortening the time to compute project critical paths. In other words: if the project key path comprises N tasks, the project key path can be obtained through i iterations, each iteration is used for determining one task in the project key path, the maximum value of i is N-1, and the minimum value is 1, wherein:
when i is equal to 1, the task corresponding to the ith iteration point is the task executed last by the project, and when i is equal to N-1, the task corresponding to the ith iteration point is the task executed first by the project;
and if a plurality of tasks are executed before the ith iteration point corresponds to the task, the task corresponding to the (i + 1) th iteration point is the task with the latest end time in the plurality of tasks.
As described above, the process arrangement map may be constructed in advance, and then, a specific implementation of constructing the process arrangement map is described.
In one example, a software program that implements at least one task of the project may be obtained and the flow orchestration graph may be constructed using the software program.
It should be noted that after a software program for implementing at least one task of the project is obtained, the software program may be used to extract the graph entities (for example, task names), the association relationship between the graph entities, and the attributes of the graph entities, and then the graph entities, the association relationship between the graph entities, and the attributes of the graph entities are stored, so that the process arrangement graph may be obtained.
Wherein:
when the extraction of the map entity is specifically realized, one method is to perform feature modeling according to a known entity instance, process the software program by using the model to obtain a new entity list, and iteratively generate an entity labeling corpus aiming at the new entity modeling. The other method is to identify named entities from the search logs by using server logs based on semantic features of the entities and to cluster the identified entity objects by using a clustering algorithm.
In addition, in order to make the obtained process arrangement map entity more accurate, the preliminarily extracted map entity can be processed by an entity disambiguation or coreference resolution method.
It is understood that after S103 is executed, the developer may further develop the new task. In one example, after the new task is developed, the flow orchestration graph and the project key path may be further updated by a software program of the new task. So that when a new task is available, the updated flow arrangement map can be used to determine the position of the new task to be inserted into the updated project key path.
It should be noted that, the process arrangement map is updated by using the software program of the newly added task, and there may be two ways, namely, a comprehensive update, in which the process arrangement map is reconstructed by using the software program of the newly added task and the software program of the at least one task. The other mode is incremental updating, that is, a new flow arrangement map is constructed by using the flow arrangement map mentioned in S102 and the software program of the newly added task, and the related information of the newly added task is added to the existing flow arrangement map to obtain the new flow arrangement map.
Exemplary device
Based on the method provided by the above embodiment, the embodiment of the present application further provides an apparatus, which is described below with reference to the accompanying drawings.
Referring to fig. 2, a schematic structural diagram of a data processing apparatus based on a knowledge graph in the embodiment of the present application is shown. The apparatus 200 may specifically include, for example: a first determining unit 201, a second determining unit 202 and a third determining unit 203.
A first determining unit 201, configured to determine an attribute of the newly added task;
a second determining unit 202, configured to match the attribute of the newly added task with a process layout, and determine a target map entity associated with the newly added task, where the process layout includes: the map entities, the incidence relation among the map entities and the attributes of all the map entities;
a third determining unit 203, configured to determine, according to the target graph entity and a project key path, a position where the newly added task needs to be inserted into the project key path, where the project key path is a longest path for implementing a project, and the project key path is used to characterize: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented.
Optionally, the apparatus further comprises:
and the calculating unit is used for calculating the project key path according to the flow arrangement map.
Optionally, the project critical path includes N tasks, and the computing unit is configured to:
obtaining the project key path through i iterations, wherein each iteration is used for determining one task in the project key path, the maximum value of i is N-1, and the minimum value is 1, and the method comprises the following steps:
when i is equal to 1, the task corresponding to the ith iteration point is the task executed last by the project, and when i is equal to N-1, the task corresponding to the ith iteration point is the task executed first by the project;
and if a plurality of tasks are executed before the ith iteration point corresponds to the task, the task corresponding to the (i + 1) th iteration point is the task with the latest end time in the plurality of tasks.
Optionally, the apparatus further comprises:
an acquisition unit for acquiring a software program that implements at least one task of the project;
and the construction unit is used for constructing the process arrangement map by utilizing the software program.
Optionally, after the development of the new task is completed, the apparatus further includes:
and the updating unit is used for updating the process arrangement map by using the software program of the newly added task.
Since the apparatus 200 is an apparatus corresponding to the method provided in the above method embodiment, and the specific implementation of each unit of the apparatus 200 is the same as that of the above method embodiment, for the specific implementation of each unit of the apparatus 200, reference may be made to the description part of the above method embodiment, and details are not repeated here.
It should be noted that the data processing method and device based on the knowledge graph provided by the invention can be used in the field of big data or the field of finance. The above are only examples, and do not limit the application field of the data processing method and apparatus based on the knowledge graph provided by the present invention.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice in the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the attached claims
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (10)
1. A method of data processing based on a knowledge graph, the method comprising:
determining the attribute of the newly added task;
matching the attribute of the newly added task with a process arrangement map, and determining a target map entity associated with the newly added task, wherein the process arrangement map comprises the following steps: the map entities, the incidence relation among the map entities and the attributes of all the map entities;
determining the position of the newly added task which needs to be inserted into a project key path according to the target graph entity and the project key path, wherein the project key path is the longest path for realizing a project, and the project key path is used for representing: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented.
2. The method of claim 1, further comprising:
and calculating the project key path according to the flow arrangement map.
3. The method of claim 2, wherein the project critical path includes N tasks, and wherein computing the project critical path according to the flow orchestration graph comprises:
obtaining the project key path through i iterations, wherein each iteration is used for determining one task in the project key path, the maximum value of i is N-1, and the minimum value is 1, and the method comprises the following steps:
when i is equal to 1, the task corresponding to the ith iteration point is the task executed last by the project, and when i is equal to N-1, the task corresponding to the ith iteration point is the task executed first by the project;
and if a plurality of tasks are executed before the ith iteration point corresponds to the task, the task corresponding to the (i + 1) th iteration point is the task with the latest end time in the plurality of tasks.
4. The method of claim 1, further comprising:
obtaining a software program that implements at least one task of the project;
and constructing the process arrangement map by using the software program.
5. The method of claim 4, wherein after the development of the new task is completed, the method further comprises:
and updating the process arrangement map by using the software program of the newly added task.
6. A data processing apparatus based on a knowledge-graph, the apparatus comprising:
the first determining unit is used for determining the attribute of the newly added task;
a second determining unit, configured to match an attribute of the newly added task with a process layout, and determine a target map entity associated with the newly added task, where the process layout includes: the map entities, the incidence relation among the map entities and the attributes of all the map entities;
a third determining unit, configured to determine, according to the target graph entity and a project key path, a position where the newly added task needs to be inserted into the project key path, where the project key path is a longest path for implementing a project, and the project key path is used to characterize: a plurality of tasks of the project and an execution order among the plurality of tasks are implemented.
7. The apparatus of claim 6, further comprising:
and the calculating unit is used for calculating the project key path according to the flow arrangement map.
8. The apparatus according to claim 7, wherein the project critical path includes N tasks, and the computing unit is configured to:
obtaining the project key path through i iterations, wherein each iteration is used for determining one task in the project key path, the maximum value of i is N-1, and the minimum value is 1, and the method comprises the following steps:
when i is equal to 1, the task corresponding to the ith iteration point is the task executed last by the project, and when i is equal to N-1, the task corresponding to the ith iteration point is the task executed first by the project;
and if a plurality of tasks are executed before the ith iteration point corresponds to the task, the task corresponding to the (i + 1) th iteration point is the task with the latest end time in the plurality of tasks.
9. The apparatus of claim 6, further comprising:
an acquisition unit for acquiring a software program that implements at least one task of the project;
and the construction unit is used for constructing the process arrangement map by utilizing the software program.
10. The apparatus of claim 9, wherein after the new task development is completed, the apparatus further comprises:
and the updating unit is used for updating the process arrangement map by using the software program of the newly added task.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111094332.7A CN113742497A (en) | 2021-09-17 | 2021-09-17 | Data processing method and device based on knowledge graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111094332.7A CN113742497A (en) | 2021-09-17 | 2021-09-17 | Data processing method and device based on knowledge graph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113742497A true CN113742497A (en) | 2021-12-03 |
Family
ID=78739722
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111094332.7A Pending CN113742497A (en) | 2021-09-17 | 2021-09-17 | Data processing method and device based on knowledge graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113742497A (en) |
-
2021
- 2021-09-17 CN CN202111094332.7A patent/CN113742497A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11036483B2 (en) | Method for predicting the successfulness of the execution of a DevOps release pipeline | |
| US9462042B2 (en) | System and method for enabling application discovery by automation needs | |
| CN109829144B (en) | Method and device for cross-table referencing of online table | |
| CN106062751B (en) | Management of data profiling operations relating to data types | |
| CN111061833A (en) | Data processing method and device, electronic equipment and computer readable storage medium | |
| CN108647357B (en) | Data query method and device | |
| US20200210427A1 (en) | Column lineage and metadata propagation | |
| US10303469B1 (en) | Commit graph generation | |
| WO2022132944A1 (en) | Generation and/or recommendation of tools for automating aspects of computer programming | |
| CN115543402B (en) | Software knowledge graph increment updating method based on code submission | |
| CN111026433A (en) | Method, system and medium for automatically repairing software code quality problem based on code change history | |
| US11429378B1 (en) | Change estimation in version control system | |
| WO2020205861A1 (en) | Hierarchical machine learning architecture including master engine supported by distributed light-weight real-time edge engines | |
| CN109829141B (en) | Project table generation method and device | |
| CN114489950A (en) | Component adapting method and device, electronic equipment and storage medium | |
| JP6481387B2 (en) | Related information providing method, related information providing apparatus, and related information providing program | |
| US20100030732A1 (en) | System and method to create process reference maps from links described in a business process model | |
| CN111460137A (en) | Micro-service focus identification method, device and medium based on topic model | |
| CN115469849B (en) | Service processing system, method, electronic equipment and storage medium | |
| CN113742497A (en) | Data processing method and device based on knowledge graph | |
| US9396239B2 (en) | Compiling method, storage medium and compiling apparatus | |
| US10963244B2 (en) | Commit reversion detection | |
| JP6336922B2 (en) | Business impact location extraction method and business impact location extraction device based on business variations | |
| JP6867319B2 (en) | Inter-vocabulary relationship inferring device and inter-vocabulary relationship inferring method | |
| US20090228252A1 (en) | Method and system for translating logical constraints to linear constraints |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |