Systems and methods for manipulating time-dependent relationships in knowledge graph data structures
US12405972B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 25, 2022 |
| Grant date | Sep 2, 2025 |
| Priority date | — |
| Expiry date | Dec 6, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2477
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Various examples are directed to systems and methods for utilizing relationship data. A computing system may receive a time-dependent query against a knowledge graph data structure. The computing system may access confirmation data from the knowledge graph data structure, the confirmation data describing a first plurality of confirmation points-in-time at which the first test relationship is true. The computing system may determine that at least one of a beginning or an end of a first time period associated with a test relationship of the time-dependent query is not defined by the knowledge graph data structure. The computing system may determine a response to the first time-dependent query indicating a veracity of the test relationship at a test point-in-time using the first plurality of confirmation points-and-time.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.