Computer implemented method for the automated analysis or use of data

A computer-based system configured to analyse data, the system being configured to:

• (a) store or access in a memory a structured, machine-readable representation of data that conforms to a machine-readable language;
• the structured, machine-readable representation of data including representations of user speech or text input to a human/machine interface;
• in which the structured, machine-readable representation of data that conforms to the machine-readable language includes reasoning passages;
• (b) automatically process the structured representations to analyse the user speech or text input to a human/machine interface, including processing at least some of the reasoning passages to reason, including fetching and executing one or more initial reasoning passages to return other passages with unknowns that need to be processed, and the results of that processing is a tree of connection that is used to give results for the one or more initial reasoning passages, in which the tree of connection is stored and the processing of the other passages with unknowns happens in parallel, allowing data fetching and exploration of reasoning to be parallelized;
• in which the machine-readable representation comprises semantic nodes and passages;
• and in which a semantic node represents an entity and is itself represented by an identifier;
• and a passage is either (i) a semantic node or (ii) a combination of semantic nodes;
• and where machine-readable meaning comes from the choice of semantic nodes and the way they are combined and ordered as passages;
• in which the machine-readable representation includes a plurality of tenets, statements or other rules (“Tenets”) defining objectives or motives, also represented using the machine-readable representations;
• and in which the computer-based system is configured to analyze a potential action to determine whether executing the potential action would optimize or otherwise affect achievement or realization of those Tenets;
• and in which the computer-based system is configured to decide on actions only if the actions optimize or otherwise positively affect the achievement or realization of those Tenets.

A computer-based system configured to implement a method in which a structured, machine-readable representation of data that conforms to a machine-readable language comprises semantic nodes and passages;

• and in which a semantic node represents an entity and is itself represented by an identifier;
• and a passage is either (i) a semantic node or (ii) a combination of semantic nodes;
• and where machine-readable meaning comes from the choice of semantic nodes and the way they are combined and ordered as passages;
• in which the structured, machine-readable representation of data that conforms to the machine-readable language includes reasoning passages;
• the method including processing at least some of the reasoning passages to reason, including fetching and executing one or more initial reasoning passages to return other passages with unknowns that need to be processed, and the results of that processing is a tree of connection that is used to give results for the one or more initial reasoning passages, in which the tree of connection is stored and the processing of the other passages with unknowns happens in parallel, allowing data fetching and exploration of reasoning to be parallelized;
• in which the machine-readable representation includes a plurality of tenets, statements or other rules (“Tenets”) defining objectives or motives, also represented using the machine-readable representations;
• and in which the computer-based system is configured to analyze a potential action to determine whether executing the potential action would optimize or otherwise affect achievement or realization of those Tenets;
• and in which the computer-based system is configured to decide on actions only if the actions optimize or otherwise positively affect the achievement or realization of those Tenets.

A computer system including a processor and a memory, the processor configured to answer a question, the processor configured to use a processing language in which semantic nodes are represented in the processing language, the semantic nodes including semantic links between semantic nodes wherein the semantic links are themselves semantic nodes, in which each semantic node denotes one specific meaning, in which a combination of semantic nodes defines a semantic node, in which expressions in the processing language may be nested, in which the question is represented in the processing language, in which reasoning steps are represented in the processing language to represent semantics of the reasoning steps, in which computation units are represented in the processing language, wherein the computation units are configured to calculate something or return a result, wherein the memory is configured to store or access the representations in the processing language, and wherein the processor is configured to answer the question using the reasoning steps, the computation units and the semantic nodes, and to store an answer to the question in the memory;

• in which a structured, machine-readable representation that conforms to a machine-readable language comprises semantic nodes and passages;
• and in which a semantic node represents an entity and is itself represented by an identifier;
• and a passage is either (i) a semantic node or (ii) a combination of semantic nodes;
• and where machine-readable meaning comes from the choice of semantic nodes and the way they are combined and ordered as passages;
• in which the structured, machine-readable representation of data that conforms to the machine-readable language includes reasoning passages;
• in which the processor is configured to process at least some of the reasoning passages to reason, including fetching and executing one or more initial reasoning passages to return other passages with unknowns that need to be processed, and the results of that processing is a tree of connection that is used to give results for the one or more initial reasoning passages, in which the tree of connection is stored and the processing of the other passages with unknowns happens in parallel, allowing data fetching and exploration of reasoning to be parallelized;
• in which the machine representation includes a plurality of tenets, statements or other rules (“Tenets”) defining objectives or motives, also represented using the machine representation;
• and in which the system is configured to analyze a potential action to determine whether executing the potential action would optimize or otherwise affect achievement or realization of those Tenets;
• and in which the system is configured to decide on actions are only if the actions optimize or otherwise positively affect the achievement or realization of those Tenets.

A computer-implemented method, the method using a computer system including a processor and a memory, the processor configured to use a processing language in which semantic nodes are represented in the processing language, the semantic nodes including semantic links between semantic nodes wherein the semantic links are themselves semantic nodes, in which each semantic node denotes one specific meaning, in which a combination of semantic nodes defines a semantic node, in which expressions in the processing language may be nested, in which the question is represented in the processing language, in which reasoning steps are represented in the processing language to represent semantics of the reasoning steps, in which computation units are represented in the processing language, wherein the computation units calculate something or return a result, wherein the memory is configured to store or access the representations in the processing language, the method including the steps of:

• (i) the processor answering the question using the reasoning steps, the computation units and the semantic nodes, and
• (ii) the processor storing an answer to the question in the memory;
• in which a structured, machine-readable representation that conforms to a machine-readable language comprises semantic nodes and passages;
• and in which a semantic node represents an entity and is itself represented by an identifier;
• and a passage is either (i) a semantic node or (ii) a combination of semantic nodes;
• and where machine-readable meaning comes from the choice of semantic nodes and the way they are combined and ordered as passages;
• in which the structured, machine-readable representation of data that conforms to the machine-readable language includes reasoning passages;
• the method including processing at least some of the reasoning passages to reason, including fetching and executing one or more initial reasoning passages to return other passages with unknowns that need to be processed, and the results of that processing is a tree of connection that is used to give results for the one or more initial reasoning passages, in which the tree of connection is stored and the processing of the other passages with unknowns happens in parallel, allowing data fetching and exploration of reasoning to be parallelized;
• in which the machine representation includes a plurality of tenets, statements or other rules (“Tenets”) defining objectives or motives, also represented using the machine representation;
• and in which a potential action is analysed to determine whether executing the potential action would optimize or otherwise affect achievement or realization of those Tenets;
• and actions are decided on only if the actions optimize or otherwise positively affect the achievement or realization of those Tenets.