# US 2026/0277969 A1 · Extracting knowledge from a knowledge database > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2026/0277969 A1 - Document ID: US20260277969A1 - Status: Published application - Kind: A1 - Application number: 19/680,784 - Filed: 2026-05-18 - Published: 2026-09-17 - Earliest claimed: 2020-09-23 - Assignees: entigenlogic LLC - Applicants: entigenlogic LLC - Inventors: Frank John Williams; Stephen Emerson Sundberg; Ameeta Vasant Reed; Dennis Arlen Roberson; Thomas James MacTavish; Karl Olaf Knutson; Jessy Thomas; Niklas Josiah MacTavish; David Michael Corns, II; Andrew Chu; Kyle Edward Alberth; Ali Fattahian; Zachary John McCord; Ahmad Abdelqader Abunaser; Gary W. Grube - Web page: https://patentgrep.com/patent/US20260277969A1 ## CPC - G06F 16/3344: {using natural language analysis} - G06F 40/30: Semantic analysis - G06N 5/02: Knowledge representation; Symbolic representation - G06N 5/022: Knowledge engineering; Knowledge acquisition - G06N 5/041: {Abduction} - G06N 5/046: Forward inferencing; Production systems - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS ## Abstract A method executed by a computing device includes determining a set of identigens for each query word of a query to produce sets of identigens. A set of identigens of the sets of identigens represents one or more different meanings of a query word of the query. The method further includes determining that a first query word is associated with a first query command. The method further includes interpreting remaining sets of identigens to produce a query entigen group that represents a most likely meaning interpretation of remaining query words. The method further includes accessing a knowledge database utilizing the query entigen group to obtain entigen information and outputting a response based on the entigen information and the first query command. ## Claims ### Claim 1 A method for execution by a computing device, the method comprising: determining a set of identigens for each query word of a query to produce a plurality of sets of identigens, wherein a set of identigens of the plurality of sets of identigens represents one or more different meanings of a query word of the query, wherein each identigen of the set of identigens includes a meaning identifier for a particular different meaning of the one or more different meanings, an instance identifier that includes a particular spelling in a particular language for the query word, and an interpretation time reference, wherein each meaning identifier associated with a particular set of identigens represents a different meaning of the one or more different meanings of a corresponding query word of the query, wherein each interpretation time reference provides time information when an interpretation of a particular corresponding different meaning of the one or more different meanings applies, wherein a first set of identigens of the plurality of sets of identigens is produced for a first query word of the query, wherein each identigen of the first set of identigens represents a different meaning of the first query word; determining that each corresponding sequentially adjacent identigen of a second set of identigens of the plurality of sets of identigens does not pair with any identigen of the first set of identigens in accordance with identigen pairing rules of a knowledge database; determining that the first query word matches a first query command of a set of query commands; and interpreting, in accordance with the identigen pairing rules of the knowledge database, remaining sets of identigens of the plurality of sets of identigens that excludes the first set of identigens and includes the second set of identigens to produce a query entigen group that represents a most likely meaning interpretation of remaining query words of the query, wherein each entigen of the query entigen group corresponds to a selected identigen of a remaining set of identigens having a selected meaning of one or more different meanings of a remaining query word, wherein each selected identigen favorably pairs with at least one corresponding sequentially adjacent identigen of another set of identigens of the plurality of sets of identigens in accordance with the identigen pairing rules of the knowledge database, wherein each entigen of the query entigen group represents a corresponding single conceivable and perceivable thing in space and time that is independent of language and corresponds to an interpretation time reference of a corresponding selected identigen associated with the query entigen group, wherein the knowledge database includes a multitude of entigen groups associated with a multitude of topics, wherein the multitude of topics includes a topic of the query, wherein each entigen group of the multitude of entigen groups includes a corresponding plurality of entigens and one or more entigen relationships between at least some of the corresponding plurality of entigens. ### Claim 2 (depends on 1) The method of claim 1 further comprising: determining that each corresponding sequentially adjacent identigen of a third set of identigens of the plurality of sets of identigens does not pair with any identigen of the second set of identigens in accordance with the identigen pairing rules of the knowledge database; determining that a second query word of the query matches a second query command of the set of query commands, wherein the second set of identigens is produced for the second query word of the query; and interpreting, in accordance with the identigen pairing rules of the knowledge, the remaining sets of identigens of the plurality of sets of identigens that excludes the first and second sets of identigens and includes the third set of identigens to produce the query entigen group so that the query entigen group represents the most likely meaning interpretation of the remaining query words of the query. ### Claim 3 (depends on 1) The method of claim 1 further comprising: accessing the knowledge database utilizing the query entigen group to obtain entigen information, wherein the entigen information is associated with the query entigen group; and generating a response entigen group utilizing the entigen information and based on the first query command. ### Claim 4 (depends on 3) The method of claim 3 further comprising: outputting a response that includes words associated with the response entigen group. ### Claim 5 (depends on 1) The method of claim 1 further comprising: identifying a single corresponding sequentially adjacent identigen of the second set of identigens of the plurality of sets of identigens that pairs with the first query command in accordance with identigen-command pairing rules of the knowledge database to produce a second identigen selection for the second set of identigens; and identifying a second entigen of the query entigen group that corresponds to the second identigen selection for the second set of identigens. ### Claim 6 (depends on 5) The method of claim 5 further comprising: accessing the knowledge database utilizing the second entigen of the query entigen group to obtain entigen information, wherein the entigen information is associated with the query entigen group; and generating a response entigen group utilizing the entigen information and based on the first query command. ### Claim 7 A computing device of a computing system, the computing device comprises: an interface; local memory; and processor operably coupled to the interface and the local memory, wherein the local memory stores operational instructions that, when executed by the processor, causes the computing device to: determine a set of identigens for each query word of a query to produce a plurality of sets of identigens, wherein a set of identigens of the plurality of sets of identigens represents one or more different meanings of a query word of the query, wherein each identigen of the set of identigens includes a meaning identifier for a particular different meaning of the one or more different meanings, an instance identifier that includes a particular spelling in a particular language for the query word, and an interpretation time reference, wherein each meaning identifier associated with a particular set of identigens represents a different meaning of the one or more different meanings of a corresponding query word of the query, wherein each interpretation time reference provides time information when an interpretation of a particular corresponding different meaning of the one or more different meanings applies, wherein a first set of identigens of the plurality of sets of identigens is produced for a first query word of the query, wherein each identigen of the first set of identigens represents a different meaning of the first query word; determine that each corresponding sequentially adjacent identigen of a second set of identigens of the plurality of sets of identigens does not pair with any identigen of the first set of identigens in accordance with identigen pairing rules of a knowledge database; determine that the first query word matches a first query command of a set of query commands; and interpret, in accordance with the identigen pairing rules of the knowledge database, remaining sets of identigens of the plurality of sets of identigens that excludes the first set of identigens and includes the second set of identigens to produce a query entigen group that represents a most likely meaning interpretation of remaining query words of the query, wherein each entigen of the query entigen group corresponds to a selected identigen of a remaining set of identigens having a selected meaning of one or more different meanings of a remaining query word, wherein each selected identigen favorably pairs with at least one corresponding sequentially adjacent identigen of another set of identigens of the plurality of sets of identigens in accordance with the identigen pairing rules of the knowledge database, wherein each entigen of the query entigen group represents a corresponding single conceivable and perceivable thing in space and time that is independent of language and corresponds to an interpretation time reference of a corresponding selected identigen associated with the query entigen group, wherein the knowledge database includes a multitude of entigen groups associated with a multitude of topics, wherein the multitude of topics includes a topic of the query, wherein each entigen group of the multitude of entigen groups includes a corresponding plurality of entigens and one or more entigen relationships between at least some of the corresponding plurality of entigens. ### Claim 8 (depends on 7) The computing device of claim 7, wherein the processor further functions to: determine that each corresponding sequentially adjacent identigen of a third set of identigens of the plurality of sets of identigens does not pair with any identigen of the second set of identigens in accordance with the identigen pairing rules of the knowledge database; determine that a second query word of the query matches a second query command of the set of query commands, wherein the second set of identigens is produced for the second query word of the query; and interpret, in accordance with the identigen pairing rules of the knowledge, the remaining sets of identigens of the plurality of sets of identigens that excludes the first and second sets of identigens and includes the third set of identigens to produce the query entigen group so that the query entigen group represents the most likely meaning interpretation of the remaining query words of the query. ### Claim 9 (depends on 7) The computing device of claim 7, wherein the processor further functions to: access, via the interface, the knowledge database utilizing the query entigen group to obtain entigen information, wherein the entigen information is associated with the query entigen group; and generate a response entigen group utilizing the entigen information and based on the first query command. ### Claim 10 (depends on 9) The computing device of claim 9, wherein the processor further functions to: output, via the interface, a response that includes words associated with the response entigen group. ### Claim 11 (depends on 7) The computing device of claim 7, wherein the processor further functions to: identify a single corresponding sequentially adjacent identigen of the second set of identigens of the plurality of sets of identigens that pairs with the first query command in accordance with identigen-command pairing rules of the knowledge database to produce a second identigen selection for the second set of identigens; and identify a second entigen of the query entigen group that corresponds to the second identigen selection for the second set of identigens. ### Claim 12 (depends on 11) The computing device of claim 11, wherein the processor further functions to: access, via the interface, the knowledge database utilizing the second entigen of the query entigen group to obtain entigen information, wherein the entigen information is associated with the query entigen group; and generate a response entigen group utilizing the entigen information and based on the first query command. ### Claim 13 A non-transitory computer readable memory comprising: first memory element that stores operational instructions that, when executed by a processor, causes the processor to: determine a set of identigens for each query word of a query to produce a plurality of sets of identigens, wherein a set of identigens of the plurality of sets of identigens represents one or more different meanings of a query word of the query, wherein each identigen of the set of identigens includes a meaning identifier for a particular different meaning of the one or more different meanings, an instance identifier that includes a particular spelling in a particular language for the query word, and an interpretation time reference, wherein each meaning identifier associated with a particular set of identigens represents a different meaning of the one or more different meanings of a corresponding query word of the query, wherein each interpretation time reference provides time information when an interpretation of a particular corresponding different meaning of the one or more different meanings applies, wherein a first set of identigens of the plurality of sets of identigens is produced for a first query word of the query, wherein each identigen of the first set of identigens represents a different meaning of the first query word; and second memory element that stores operational instructions that, when executed by the processor, causes the processor to: determine that each corresponding sequentially adjacent identigen of a second set of identigens of the plurality of sets of identigens does not pair with any identigen of the first set of identigens in accordance with identigen pairing rules of a knowledge database; determine that the first query word matches a first query command of a set of query commands; and interpret, in accordance with the identigen pairing rules of the knowledge database, remaining sets of identigens of the plurality of sets of identigens that excludes the first set of identigens and includes the second set of identigens to produce a query entigen group that represents a most likely meaning interpretation of remaining query words of the query, wherein each entigen of the query entigen group corresponds to a selected identigen of a remaining set of identigens having a selected meaning of one or more different meanings of a remaining query word, wherein each selected identigen favorably pairs with at least one corresponding sequentially adjacent identigen of another set of identigens of the plurality of sets of identigens in accordance with the identigen pairing rules of the knowledge database, wherein each entigen of the query entigen group represents a corresponding single conceivable and perceivable thing in space and time that is independent of language and corresponds to an interpretation time reference of a corresponding selected identigen associated with the query entigen group, wherein the knowledge database includes a multitude of entigen groups associated with a multitude of topics, wherein the multitude of topics includes a topic of the query, wherein each entigen group of the multitude of entigen groups includes a corresponding plurality of entigens and one or more entigen relationships between at least some of the corresponding plurality of entigens. ### Claim 14 (depends on 13) The non-transitory computer readable memory of claim 13 further comprising: third memory element that stores operational instructions that, when executed by the processor, causes the processor to: determine that each corresponding sequentially adjacent identigen of a third set of identigens of the plurality of sets of identigens does not pair with any identigen of the second set of identigens in accordance with the identigen pairing rules of the knowledge database; determine that a second query word of the query matches a second query command of the set of query commands, wherein the second set of identigens is produced for the second query word of the query; and interpret, in accordance with the identigen pairing rules of the knowledge, the remaining sets of identigens of the plurality of sets of identigens that excludes the first and second sets of identigens and includes the third set of identigens to produce the query entigen group so that the query entigen group represents the most likely meaning interpretation of the remaining query words of the query. ### Claim 15 (depends on 13) The non-transitory computer readable memory of claim 13 further comprising: the second memory element stores further operational instructions that, when executed by the processor, causes the processor to: access the knowledge database utilizing the query entigen group to obtain entigen information, wherein the entigen information is associated with the query entigen group; and generate a response entigen group utilizing the entigen information and based on the first query command. ### Claim 16 (depends on 15) The non-transitory computer readable memory of claim 15 further comprising: the second memory element stores further operational instructions that, when executed by the processor, causes the processor to: output a response that includes words associated with the response entigen group. ### Claim 17 (depends on 13) The non-transitory computer readable memory of claim 13 further comprising: the second memory element stores further operational instructions that, when executed by the processor, causes the processor to: identify a single corresponding sequentially adjacent identigen of the second set of identigens of the plurality of sets of identigens that pairs with the first query command in accordance with identigen-command pairing rules of the knowledge database to produce a second identigen selection for the second set of identigens; and identify a second entigen of the query entigen group that corresponds to the second identigen selection for the second set of identigens. ### Claim 18 (depends on 17) The non-transitory computer readable memory of claim 17 further comprising: the second memory element stores further operational instructions that, when executed by the processor, causes the processor to: access the knowledge database utilizing the second entigen of the query entigen group to obtain entigen information, wherein the entigen information is associated with the query entigen group; and generate a response entigen group utilizing the entigen information and based on the first query command.