18554281. COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM AND DEVICE FOR EXTENDING A GRAPH simplified abstract (Robert Bosch GmbH)
Contents
- 1 COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM AND DEVICE FOR EXTENDING A GRAPH
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM AND DEVICE FOR EXTENDING A GRAPH - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Key Features and Innovation
- 1.6 Potential Applications
- 1.7 Problems Solved
- 1.8 Benefits
- 1.9 Commercial Applications
- 1.10 Prior Art
- 1.11 Frequently Updated Research
- 1.12 Questions about Graph Extension
- 1.13 Original Abstract Submitted
COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM AND DEVICE FOR EXTENDING A GRAPH
Organization Name
Inventor(s)
Henrik Dibowski of Bad Liebenzell (DE)
COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM AND DEVICE FOR EXTENDING A GRAPH - A simplified explanation of the abstract
This abstract first appeared for US patent application 18554281 titled 'COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM AND DEVICE FOR EXTENDING A GRAPH
Simplified Explanation
The patent application describes a method for extending a graph, specifically a knowledge graph, by defining input variables, determining property assertion constraints, and executing queries to find permissible instances and literals for extending the graph database.
Key Features and Innovation
- Method for extending a graph, particularly a knowledge graph
- Predefining input variables with instances and relations
- Determining property assertion constraints
- Executing queries to find permissible instances and literals for graph extension
Potential Applications
This technology can be applied in various fields such as data analysis, information retrieval, semantic web development, and artificial intelligence.
Problems Solved
This technology addresses the need for efficiently extending knowledge graphs with relevant instances and literals to enhance data representation and retrieval.
Benefits
- Improved graph database extension process
- Enhanced data representation and retrieval capabilities
- Increased efficiency in knowledge graph development
Commercial Applications
- Data analysis software tools
- Semantic web development platforms
- Artificial intelligence applications in information retrieval
Prior Art
Researchers can explore existing literature on knowledge graph extension methods, graph database management, and semantic web technologies for related prior art.
Frequently Updated Research
Stay updated on advancements in graph database management, knowledge graph extension techniques, and semantic web development for the latest research in this field.
Questions about Graph Extension
How does this method improve the efficiency of extending a knowledge graph?
This method streamlines the process by predefining input variables and executing queries to find permissible instances and literals for graph extension, reducing manual effort and enhancing data representation.
What are the potential applications of this technology beyond knowledge graphs?
This technology can be applied in various fields such as data analysis, information retrieval, semantic web development, and artificial intelligence for improving data representation and retrieval processes.
Original Abstract Submitted
Device, computer program, computer-implemented method for extending a graph, in particular a knowledge graph. The method includes: predefining an input variable comprising an instance to be extended and a relation associated with the instance to be extended and/or an attribute of the graph related to the instance to be extended, determining a first property assertion constraint associated with the input variable, determining a query fragment for the first property assertion constraint, determining a query including a predefined core query and the query fragment, executing the query on the graph. A first result is determined that includes either at least one permissible instance and/or at least one permissible literal for extending the graph database or no instance and no literal.