Interactive thinking graph-based knowledge base device

Abstract

The present invention relates to the field of artificial intelligence and the field of natural language processing, and relates to a method for representing knowledge and a thinking method, for use in reasoning and question answering, and specifically relates to an interactive thinking graph-based knowledge base device. Disclosed in the present patent is the interactive thinking graph-based knowledge base device, which may be used for constructing a fusion knowledge base based on natural languages and unlimited languages, or serve as a component module of another artificial intelligence system to provide a function of knowledge representation or question answering based on reasoning.

Description

An interactive mind map knowledge base device Technical Field

[0001] The present invention relates to the fields of artificial intelligence and natural language processing, and is a method for representing knowledge and thinking methods. The knowledge and thinking methods represented by this method can be used for reasoning and answering questions. Specifically, it is an interactive mind map knowledge base device. Background Art

[0002] In order to build an artificial intelligence system that can think like humans, it is necessary to model and represent human knowledge and thinking methods. A commonly used knowledge modeling method is the knowledge graph, which represents knowledge in the form of triples. Although the knowledge graph structure is standardized and suitable for querying, this representation does not conform to the understanding habits of ordinary people. It is difficult for ordinary people to quickly and accurately understand the complex knowledge represented by a series of triples as a whole. As a result, it is very difficult to create knowledge based on triples, proofread and review knowledge, and design computational methods to process knowledge. On the other hand, the knowledge graph is a representation method for knowledge rather than thinking methods. Schema technology based on knowledge graph technology can represent a very limited number of thinking methods, such as the transitivity of relationships, but it still lacks the ability to effectively represent complex thinking methods.

[0003] On the other hand, computer programming languages ​​are commonly used to model thinking methods. These languages ​​are not easily understood by ordinary people and require specialized training to master. Furthermore, it is very difficult for different individuals to communicate their thinking methods through computer programming languages. It is difficult for one person to understand a complex program written by another without annotations or with incomplete annotations. This makes large-scale integration and dynamic adjustment of thinking methods based on computer programming languages ​​very difficult.

[0004] At the same time, thinking methods are also a form of knowledge. Despite this, computer programming languages ​​are difficult to represent using knowledge graphs, nor are they easy to create or modify based on knowledge graphs. Therefore, we still lack a technology that allows us to collaboratively represent knowledge and thinking methods. In this case, the knowledge and thinking methods derived by artificial intelligence systems based on known knowledge and thinking methods can be represented using the same technology. The results of these inferences can then drive new inferences and calculations, enabling artificial intelligence systems to achieve autonomous thinking.

[0005] Thinking methods can generate additional knowledge based on reasoning based on some knowledge. If we consider knowledge as nodes and thinking methods as edges, the interconnected structure of knowledge and thinking methods can be abstracted as a mind map. In this sense, the natural language used by humans is essentially a representation of mind maps. People communicate through language and integrate mind maps: the speaker encodes a limited range of mind maps into natural language, and the listener integrates the decoded mind map with the mind map in their own brain to obtain the information conveyed by the speaker.

[0006] Neural network technology can build structurally uninterpretable mind maps based on knowledge expressed in natural language. A representative example is ChatGPT. This technology builds a mind map model based on massive amounts of training text. This model generates a text sequence as a response based on the user's prompt word. When generating a response, ChatGPT fills in the word with the highest probability at each position. Therefore, the technology essentially calculates a semantic representation of probability based on the prompt word, which may not necessarily reflect the facts. In the field of design assistance, maximizing the probability of a response is a desirable feature; however, in the field of decision assistance, generating a response that reflects the facts is even more important.

[0007] This patent discloses a method for constructing a mind map in an interpretable manner, and a knowledge base device established based on this method. The knowledge base device can interact with users based on natural language text to create and maintain a knowledge base organized in the form of a mind map. Users can ask questions to the knowledge base device, which performs reasoning calculations with the goal of answering the questions. During the reasoning calculation process, other task execution systems or data query systems can be operated as needed to dynamically obtain knowledge describing task execution results or specific data. The knowledge base device answers user questions in the form of natural language text.

[0008] To implement the aforementioned knowledge base device, the inventor noted that the classical philosopher Kant classified sentences into two categories: synthetic sentences and analytic sentences. The meaning of the predicate in a synthetic sentence is not contained in the subject; therefore, the truth of the synthetic sentence depends on the context in which it appears. In possible world semantics, the truth of a synthetic sentence depends on the world in which it appears. Synthetic sentences are used to describe factual knowledge. The meaning of the predicate in an analytic sentence is contained in the subject; therefore, the truth of an analytic sentence depends solely on its semantic structure and is independent of the context in which it appears. In possible world semantics, the truth of an analytic sentence is the same in all worlds. To simplify the description of more general sentence forms, this patent specification and claims do not distinguish between simple and complex sentences. Sentences that do not have a structure such as "one part of the semantics implies another part of the semantics" are called synthetic sentences. Sentences that have a structure such as "one part of the semantics implies another part of the semantics" are called analytic sentences. In this case, the subject of the analytic sentence is said to imply the semantics of its predicate. When an analytic sentence is a complex sentence, both its subject and predicate can be clauses. Based on this, the inventors further discovered that specific instances of analytical statements based on specific contexts can be used to illustrate a thinking method. Here, a thinking method refers to a method of inferring one fact from another. For example, "Xiao Zhang's blood pressure is 150" and "Xiao Zhang has high blood pressure" are synthetic statements that describe facts. "If a person's blood pressure is a value that can be determined as high blood pressure, then they have hypertension" is an analytical statement. Based on the context "A blood pressure value of 150 can be determined as hypertension," a specific instance of this analytical statement is "If a person's blood pressure is 150, then they have hypertension." In this case, the meanings of "high blood pressure" and "150" are their meanings in the synthetic statement "A blood pressure value of 150 can be determined as hypertension." The necessary and sufficient conditions for a specific instance of an analytical statement to be true are that the analytical statement itself is true and that its context is true. The specific instance of the analytical statement "If a person's blood pressure is 150, then they have hypertension" illustrates a thinking method. One application of this thinking method is to infer the synthetic statement "Xiao Zhang's blood pressure is 150" from the synthetic statement "Xiao Zhang has high blood pressure." If an inference relationship exists between two synthetic statements, the present invention states that the synthetic statement serving as the basis for inference implies the synthetic statement serving as the result of the inference. Therefore, the essence of applying a thinking method is to obtain an implication relationship between synthetic statements: if the synthetic statement serving as the result of the inference is not already known, then a synthetic statement serving as the result of the inference is created based on the thinking method and the synthetic statement serving as the basis for inference. Conversely, if an implication relationship is known between two synthetic statements that describe facts, then a specific instance of an analytical statement must exist. Applying the thinking method represented by it can reveal the implication relationship between the two synthetic statements.

[0009] Based on the above findings, the present invention designs a knowledge base device, whose constituent units collaboratively realize the representation of comprehensive statements, i.e., factual knowledge, the representation of specific instances of analytical statements, i.e., thinking methods, and the representation of the way of establishing specific instances of analytical statements based on comprehensive statements as contexts in an interdependent manner; these representations together constitute the representation of a complete mind map; the knowledge base device performs goal-oriented and autonomously driven thinking based on the mind map.

[0010] Summary of the Invention

[0011] This patent discloses an interactive mind map knowledge base device that can be used to build a fusion knowledge base based on natural language and not limited to any language; or as a component module of other artificial intelligence systems, providing knowledge representation or answering questions based on reasoning. The invention is achieved through the following technical solutions:

[0012] An interactive mind map knowledge base device for storing knowledge includes a mind map module, which specifically includes the following types of units;

[0013] Syntactical unit, referred to as syntactical unit; syntactical unit stores the common semantic structure of comprehensive sentences with the same semantic structure; a semantic structure represents a specific relationship between a group of unspecified concepts; a semantic structure has a set of positions for placing concepts; when a concept is placed in a specific position of a semantic structure, the concept is said to appear in the position; for example, "1+2=3" is a comprehensive sentence that conforms to the additive semantic structure, and it and "4+5=9" conform to the same semantic structure. This semantic structure has three positions for placing concepts, of which the first two are positions for placing addends, and the last one is the position for placing the sum; in the above two comprehensive sentences, the concepts "1" and "4" appear in the first position for placing concepts, respectively, the concepts "2" and "5" appear in the second position for placing concepts, respectively, and the concepts "3" and "9" appear in the third position for placing concepts, respectively; the above additive semantic structure can be understood as an expression form in the form of "?+?=?", which includes three positions for placing concepts;

[0014] A comprehensive formula unit, abbreviated as comprehensive formula; a comprehensive formula stores knowledge described by a comprehensive sentence with authenticity; when a comprehensive formula stores knowledge described by a comprehensive sentence, the comprehensive formula stores the semantic structure of the comprehensive sentence, the concepts that appear in the semantic structure at the position where the concepts are placed, and the context of the comprehensive sentence; the comprehensive formula is said to represent the comprehensive sentence;

[0015] A syntactic equivalence unit, also known as a syntactic equivalence, stores an association between two semantic structures. The association means that there is a one-to-one correspondence between the positions where concepts are placed in the two semantic structures. When the concepts appearing in the corresponding positions are the same, the two semantic structures and the concepts appearing in the positions where the concepts are placed express the same semantic meaning as a whole.

[0016] A substantially equivalent unit, referred to as a substantially equivalent unit; the knowledge base device uses codes to represent concepts; a substantially equivalent unit stores an association between two codes representing concepts, where the association means that the two codes represent the same concept;

[0017] Analogy equivalence unit, referred to as analogy equivalence; analogy equivalence stores an association between two comprehensive statements, and the meaning of the association is that the two comprehensive statements have the same context; when all comprehensive statements in the usage scenario of the knowledge base device have the same context, the knowledge base device chooses not to use the analogy equivalence; at this time, it is equivalent to that all comprehensive statements represented by the comprehensive formula in the specified mind map module have the same context, and the comprehensive formula no longer stores the context of the comprehensive statement.

[0018] As a further improvement, the knowledge base device is also used to store thinking methods; the thinking map module also includes the following types of optional units as needed:

[0019] An analytical formula unit, referred to as an analytical formula for short; an analytical formula, alone or in conjunction with a comprehensive mapping formula, stores a thinking method that illustrates a specific example of a true analytical statement; when an analytical formula stores a thinking method, the analytical formula stores the application scenario of the thinking method and a description of the process of obtaining the reasoning result by applying the thinking method;

[0020] A comprehensive mapping unit, referred to as a comprehensive mapping, stores an association between a comprehensive statement and an analytical statement, wherein the comprehensive statement is the context required for the analytical statement to be transformed into a specific instance of the analytical statement.

[0021] A predicate formula unit, also referred to as a predicate formula, stores the relationship between a comprehensive sentence and its subject. When a predicate formula stores the relationship between a comprehensive sentence and its subject, the predicate formula stores: within the comprehensive formula representing the comprehensive sentence, the position at which the concept corresponding to the subject of the comprehensive sentence appears in the semantic structure.

[0022] As a further improvement, a natural language sentence can be understood as a sequence of concepts contained therein arranged in the order of their appearance, referred to as a concept sequence. When the knowledge base device creates various units of the mind map module based on the concept sequence represented by the natural language sentence, the various units of the mind map module store the knowledge and thinking methods described by the natural language sentences corresponding to these concept sequences in the following manner:

[0023] The syntactic storage of the common semantic structure of comprehensive sentences with the same semantic structure is implemented as follows: if there is a group of comprehensive sentences, the concept sequences they represent are of the same length, the concepts differ only in a specific order, and the concepts in other orders are the same, then they conform to the common semantic structure; the positions that may exist differently in these concept sequences are called variable positions; these variable positions are named "the first", "the second" ... "the nth" variable positions in the order in which they appear in the concept sequence; this group of variable positions is the position where the concepts are placed in the semantic structure; at this time, the core attributes of the syntactic storage include: a group of variable positions; for this type of unit and other mind map module units, if it is said that there is a group of variable positions in the two mind map module units, and they correspond to each other, it means that the number of these two groups of variable positions is equal, the names are the same, and there is a corresponding relationship between the variable positions with the same name;

[0024] When a comprehensive formula stores the knowledge described by a comprehensive sentence, the comprehensive formula stores the semantic structure of the comprehensive sentence, the concepts that appear at the positions where the concepts are placed in the semantic structure, and the context of the comprehensive sentence, which is implemented as follows: a comprehensive formula stores the semantic structure that the concept sequence represented by a comprehensive sentence conforms to, the context of the comprehensive sentence, and the concepts that appear at the variable positions of the concept sequence represented by the comprehensive sentence; at this time, the comprehensive formula is said to have a group of variable positions, which correspond to the variable positions of the syntactic formula that stores the semantic structure, and the concepts that appear at the variable positions of the semantic structure also appear at the corresponding variable positions of the comprehensive formula; in this type of unit and other thinking map module units, the concepts that appear at a group of variable positions are classified according to their variables. The sequence obtained by sorting the bit names is called a variable sequence. In this case, the rank of a concept in the variable sequence is also the name of the variable position where the concept appears. Therefore, "the variable position where the concept appears" and "the rank of the concept in the variable sequence" have the same meaning. In this case, the core attributes of the comprehensive storage include: a syntactic formula, a context, a set of variable positions, and a variable sequence. The context attribute of the comprehensive formula can be left blank when it is created, and then the context of the comprehensive formula can be inferred based on the same relationship of the comprehensive formula context described by the analogical equivalent formula. When implementing this type of unit and other mind map module units, the dependent variable position attribute can be inferred from the variable sequence attribute, that is, the number of variable positions is equal to the length of the variable sequence, and the names are sequentially "the first" ... "the nth" variable positions, and the variable position attribute is no longer stored separately.

[0025] The syntactic equivalence stores an association between two semantic structures. The meaning of the association is that there is a one-to-one correspondence between the variable positions in the two semantic structures. When the concepts appearing in the corresponding positions are the same, the two semantic structures and the concepts appearing in the positions where the concepts are placed express the same semantics as a whole, which is realized as follows: if there are two semantic structures, called semantic structure form one and semantic structure form two, there is a one-to-one correspondence between their variable positions; at this time, for any pair of concept sequences, if the first one conforms to semantic structure form one and the second one conforms to semantic structure form two, and the concepts appearing in the corresponding variable positions are the same. If they are the same, they must express the same semantics; in this case, semantic structure form 1 and semantic structure form 2 are said to have equivalent meanings; the syntactic forms storing semantic structure form 1 and semantic structure form 2 are called equivalent syntactic form 1 and equivalent syntactic form 2 respectively; in this case, the core properties stored in the syntactic equivalence form include: one-to-one correspondence between equivalent syntactic form 1, equivalent syntactic form 2, and the variable positions between equivalent syntactic form 1 and equivalent syntactic form 2; there is a syntactic equivalence relationship between equivalent syntactic form 1 and equivalent syntactic form 2; the syntactic equivalence relationship is transitive, and all syntactic forms connected by the syntactic equivalence relationship are said to be equivalent; to simplify the expression, the same or equivalent syntactic forms are referred to as syntactic equivalence;

[0026] The substantially equivalent form stores an association between two codes representing concepts. The association means that the two codes represent the same concept. This is achieved as follows: the knowledge base device uses codes to represent concepts. If two codes represent the same concept, the two codes are called formal codes of the concept, or formal codes for short. If a concept corresponds to a unique code, the code is called the substantial code of the concept, or substantial code for short. In this case, the core attributes of the substantially equivalent form storage include: two formal codes representing the same concept; the two formal codes representing the concepts are said to have a substantially equivalent relationship; the substantially equivalent relationship is transitive, and all formal codes representing the concepts connected by the substantially equivalent relationship are said to be substantially equivalent.

[0027] The analogy equivalent form stores an association between two synthetic sentences. The meaning of the association is that the two synthetic sentences have the same context, which is realized as follows: the two synthetic sentences with the same context are called equivalent synthetic sentence one and equivalent synthetic sentence two, and the synthetic formulas representing the two synthetic sentences are called equivalent synthetic formula one and equivalent synthetic formula two. Therefore, the core properties of the analogy equivalent form storage include: equivalent synthetic formula one and equivalent synthetic formula two; equivalent synthetic formula one and equivalent synthetic formula two have an analogy equivalent relationship; the analogy equivalent relationship is transitive, and the contexts of all synthetic formulas connected by the analogy equivalent relationship are said to be the same.

[0028] When an analytical formula stores a thinking method, the analytical formula stores the application scenario of the thinking method and the process description of obtaining the inference result by applying the thinking method, which is realized as follows: an application scenario of the thinking method is composed of two comprehensive sentences, wherein the first comprehensive sentence contains all the semantics of the second comprehensive sentence or contains part of the semantics of the second comprehensive sentence; at this time, the first comprehensive sentence is said to contain or partially contain the second comprehensive sentence, and the comprehensive formula representing the first comprehensive sentence is said to contain or partially contain the comprehensive formula representing the second comprehensive sentence; the analytical formula is said to connect the two comprehensive formulas; the first comprehensive formula is called the cause comprehensive formula of the analytical formula; the second comprehensive formula is called the result comprehensive formula of the analytical formula; the process of obtaining the inference result by applying the thinking method is divided into two steps; the first step is the screening step, that is Find the knowledge that meets the specific conditions in the existing knowledge as the basis for reasoning; the second step is the generation step, that is, based on the knowledge obtained in the screening step or the knowledge that "existing knowledge cannot be found according to the specific conditions", generate the knowledge they contain or partially contain; the analysis formula uses two groups of variable bits and the concepts on them to represent the execution methods of the screening step and the generation step respectively; at this time, the analysis formula contains two parts: the screening part and the generation part; the screening part contains a group of variable bits and the concepts on it, which represent the execution method of the screening step; the generation part contains a group of variable bits and the concepts on it, which represent the execution method of the generation step; at this time, the core attributes stored in the analysis formula include: a cause synthesis formula, a result synthesis formula, a group of screening part variable bits, a screening part variable sequence, a group of generation part variable bits, and a generation part variable sequence;

[0029] The said synthesis-synthesis mapping type stores an association between a synthesis statement and an analysis statement. The meaning of the said association is that the said synthesis statement is the context required for the said analysis statement to be converted into a specific instance of the said analysis statement. It is realized as follows: based on the concept sequence represented by an analysis statement, it is converted into a concept sequence represented by a specific instance of the said analysis statement, that is, the concept at a specific position in the concept sequence represented by the said analysis statement is replaced by another concept in its context; when the said context can be described by a synthesis statement, the concept in the concept sequence represented by the said synthesis statement is the concept source of the aforementioned concept replacement operation; as mentioned above, the analysis statement In the concept sequence represented by the specific instance sentence of the statement, the concepts related to the application scenario of the thinking method and the process of obtaining the reasoning result are stored by the screening part variable sequence and the generating part variable sequence of the analytical formula; therefore, the result of the aforementioned concept replacement operation is that the concepts appearing on the specific analytical formula screening part and generating part variable positions will be the same as the concepts appearing on the specific comprehensive formula variable positions; the comprehensive mapping formula describes this concept identity relationship; at this time, the core attributes stored in the comprehensive mapping formula include: an analytical formula, a comprehensive formula, and the correspondence between the variable positions in the analytical formula and the variable positions in the comprehensive formula with the same concept relationship; at this time, it is said that the analytical formula and the comprehensive formula have a comprehensive mapping formula. Mapping relationship; when an analytic expression has a partition-synthesis mapping relationship with at least one synthetic expression, the analytic expression can be created based on the analytic statement rather than the concept sequence represented by the specific instance of the analytic statement; at this time, in the screening part and the generation part of the analytic expression: in the process of transforming the analytic statement into its specific instance, the variable positions corresponding to the positions that need to be replaced in the concept sequence of the analytic statement should have the concepts marked as "to be determined"; the "to be determined" concept represents a concept that has not yet been determined, which is not the same as any concept, and a "to be determined" concept is not the same as another "to be determined" concept; the meaning of the above mark is that when the analytic expression is created based on the concept sequence represented by an analytic statement, it must be created through partition-synthesis mapping relationship. The analytical formula and the partial comprehensive mapping formula can also be created by replacing the concepts of the analytical statement in a way that is described by the comprehensive mapping relationship and eliminating all "pending" concepts. On the other hand, according to the process of transforming the analytical statement into its specific instance, the positions in the analytical statement's concept sequence that need to be replaced are partially or completely replaced with the concept sequence obtained by the concepts to be replaced, that is, the partially specific or fully specific instance sentences obtained by partially or completely instantiating the analytical statement. In this case, the partial comprehensive mapping formula represents: a method of continuing to instantiate or re-instantiate the instance sentences of the partially specific or fully specific analytical statement stored in the analytical formula;For the convenience of expression, the analysis statement is understood as a partially instantiated analysis statement instance statement, and its instantiated part is empty. In this case, the creation methods of the above-mentioned analysis formulas and comprehensive mapping formulas can be uniformly expressed as follows: the analysis formula is created based on the concept sequence represented by the partial concrete or specific instance statement of the analysis statement. When the variable sequence of its screening part contains the concept of "to be determined", the "to be determined" concept must be eliminated through the concretization method represented by the comprehensive mapping formula to obtain the analysis formula of the specific instance statement of the corresponding analysis statement. In this case, the analysis formula does not represent the thinking method of the specific instance statement of the analysis statement alone, but rather represents it in coordination with the comprehensive mapping formula. When the variable sequence of the analysis formula screening part does not contain the concept of "to be determined", the analysis formula independently stores the thinking method of the specific instance statement of the analysis statement. When the variable sequence of the analysis formula screening part does not contain the concept of "to be determined", the analysis formula can also represent the thinking method of other specific instance statements of the analysis statement in coordination with the comprehensive mapping formula.

[0030] When a predicate form stores the association between a comprehensive sentence and its subject, the predicate form stores: in the comprehensive form representing the comprehensive sentence, the position where the concept corresponding to the subject of the comprehensive sentence appears in the semantic structure, which is realized as follows: the comprehensive form representing the comprehensive sentence is called the framework comprehensive form of the predicate form; the variable position where the concept corresponding to the subject of the comprehensive sentence is located in the framework comprehensive form is called the key variable position; in this case, the core attributes stored in the predicate form include: a framework comprehensive form and a set of key variable positions;

[0031] The process of creating a mind map module unit by the knowledge base device has the following characteristics: a mind map module unit records its identity and characteristic attributes that distinguish it from other similar units, and the characteristic attributes are referred to as attributes; the knowledge base device uses a code to represent the identity of the mind map module unit, which is called the identity code of the mind map module unit; the identity code of a mind map module unit is used to refer to the unit in the attributes stored in other mind map module units; the attributes stored in the mind map module unit are unique, that is, the identity code of the mind map module unit corresponds to the attribute one by one; similar to the code representing the concept, the mind map module The identity code of a unit is also divided into formal code and substantial code; when a mind map module unit only uses the substantial code representing the identity of the mind map module unit and the substantial code representing the concept when storing its attributes, the identity code of this mind map module unit is the substantial code; when a mind map module unit uses the formal code representing the identity of the mind map module unit or the formal code representing the concept when storing its attributes, the identity code of this mind map module unit is the formal code; a mind map module unit whose identity code is the formal code corresponds to only one mind map module unit whose identity code is the substantial code; multiple identity codes are formal codes The mind map module unit may correspond to the same mind map module unit whose identity code is the substance code; in the above-mentioned many-to-one relationship, a mind map module unit whose identity code is the formal code is called a formal unit of the mind map module unit whose identity code is the substance code; conversely, the mind map module unit whose identity code is the substance code is the substance unit of each mind map module unit whose identity code is the formal code; the context attribute of the comprehensive formula stores a code representing the context concept; one comprehensive formula corresponds to a specific context, and multiple comprehensive formulas may correspond to the same context, so the comprehensive formula has a specific context. The code, including formal code and substantive code, are both formal codes of context concepts; therefore, the analogy equivalence also illustrates the substantive equivalence relationship between the formal codes representing context concepts; based on the substantive equivalence relationship between concept codes and the equivalence relationship between syntactic expressions, firstly, a many-to-one relationship between the formal units and substantive units of the mind map module units whose attributes only contain concepts and syntactic expressions is established, and then, based on the established many-to-one relationship between the formal units and substantive units, the attributes of the mind map module units using formal codes are converted to those using only substantive codes for storage, and the substantive units of all mind map module units can be gradually established.

[0032] As a further improvement, the synthesis formula includes three types, namely, the normative synthesis formula, the provable synthesis formula, and the hypothetical synthesis formula; the normative synthesis formula stores necessary facts; the provable synthesis formula stores possibilities, which represents a set of possible normative synthesis formulas that conform to its meaning; the hypothetical synthesis formula stores thinking goals, which instructs the knowledge base device to perform reasoning calculations to obtain a set of possible normative synthesis formulas that conform to its meaning; the meaning of the normative synthesis formula conforming to the provable synthesis formula or the hypothetical synthesis formula is that they have the same context and equivalent syntax, and the concepts at the corresponding variable positions are the same or the concepts of the provable synthesis formula and the hypothetical synthesis formula are "to be determined"; the meaning of the corresponding variable positions is: since the variable positions of a syntactic formula correspond to the variable positions of the synthesis formula with the syntactic formula as the attribute, the one-to-one correspondence between the variable positions of the two equivalent syntactic formulas also indicates the one-to-one correspondence between the variable positions of the two synthesis formulas with the two syntactic formulas as the attributes, and the corresponding variable positions refer to the variable positions in the two synthesis formulas that have this correspondence.

[0033] As a further improvement, the analytical formula includes two types: affirmative analytical formula and negative analytical formula; the basis for one application of the thinking method stored in the affirmative analytical formula is a set of standard comprehensive formulas; the basis for one application of the thinking method stored in the negative analytical formula is a negative hypothesis comprehensive formula, which refers to a hypothesis comprehensive formula that has no known standard comprehensive formula that meets its meaning; the variable positions of the screening part of the analytical formula correspond to the variable positions of the cause comprehensive formula connected to it, and the variable positions of the generating part correspond to the variable positions of the result comprehensive formula connected to it; the reasoning result of the analytical formula has a set of variables that correspond to the variable positions of the generating part of the analytical formula Position; the generation part of the analytical formula includes a group of variable positions and the concepts on them, which are used to represent the execution method of the generation step, and are implemented as a reasoning method for obtaining the concept on the corresponding variable position in the reasoning result by representing the concept on the variable position of a generation part; the reasoning method includes: known, that is, a specific concept is fixed; reference, that is, the same as the concept on the specific variable position in the standard comprehensive formula or hypothesis comprehensive formula based on the application analytical formula; set, that is, clustering a group of standard comprehensive formulas based on the application analytical formula according to the concepts on the specific variable position, and in each category, synthesizing the concepts on the variable position based on the specific non-clustering basis into a set, and the same When confirming the existence of a concept used to refer to the set; decomposition, that is, knowing that the concept on a specific variable position in the canonical synthesis or hypothesis synthesis based on which the analytical formula is applied refers to a set, decomposing the set into its element concepts; reflection, that is, confirming the existence of a concept used to represent the canonical synthesis itself ultimately obtained by reasoning; pending, that is, the fixed "pending" concept is obtained, indicating that the concept on the variable position cannot be obtained by applying the thinking method stored in this analytical formula; at the same time, the analytical formula indicates the relationship between the specific generating part variable position and the screening part variable position, which is called the source relationship of the generating part variable position; if the generating part is on the i-th variable position The concept representing the method of "aggregation", "decomposition" or "reference" is associated with the j-th variable position of the screening part. The source relationship indicates that the basis for obtaining the concept at the i-th variable position in the inference result is: the concept at the variable position corresponding to the j-th variable position of the screening part in the comprehensive formula based on which the thinking method is applied this time; to simplify the representation, the concept that does not represent the reasoning method is directly used in the generation part to represent the "known" reasoning method, that is, the concept is fixed, and the "to be determined" concept is used to represent the "to be determined" reasoning method; the variable position where the concept representing the "known", "reflection" and "to be determined" reasoning methods is located in the generation part has no source relationship;

[0034] The predicate formula is also used to associate a task execution system or a data query system connected to a knowledge base device, and is implemented as follows: when a hypothesis synthesis formula that conforms to the predicate form is created during the reasoning process, the knowledge base device operates the task execution system or the data query system to execute the task and confirm that the standard synthesis formula for storing the task execution result exists in the mind map module, or to query the data and confirm that the standard synthesis formula for storing the query result exists in the mind map module; the hypothesis synthesis formula conforms to the form of the predicate formula, which means that the following conditions are met at the same time: 1) The framework of the hypothesis synthesis formula and the predicate formula The context of the synthesis formula is the same and the syntax is equivalent; 2) the concept at the key variable position in the framework synthesis formula is the same as the concept at the corresponding variable position in the hypothesis synthesis formula, or the concept in the framework synthesis formula is "to be determined"; 3) the concept at the variable position corresponding to the key variable position of the framework synthesis formula in the hypothesis synthesis formula is not "to be determined"; in this case, the concept at the variable position corresponding to the key variable position of the framework synthesis formula in the hypothesis synthesis formula constitutes the parameter for task execution or the condition for data query; the predicate formula can also be used to implement logical consistency checking, requiring that all reasoning results to be synthesized must be clear Specifying the subject: When multiple analytic expressions are connected to the same fruit synthesis, if the concepts representing the reasoning method on the corresponding variable positions in the generative part of these analytic expressions do not contain "to be determined", then these variable positions should be able to cover the subject of the synthetic statement represented by the fruit synthesis. The significance of this logical consistency is that if multiple analytic expressions all obtain the implication relationship that partially implies the fruit synthesis, then the partial conclusions obtained by them can be connected to form a complete conclusion when the subjects are consistent. A synthetic statement may have multiple ways of defining the subject. For example, if a synthetic statement can be rewritten in the passive voice, then the object of this synthetic statement can also be defined as the subject. The above logical consistency check can be implemented as follows: if multiple analytic expressions are connected to the same fruit synthesis, and this fruit synthesis is also a framework synthesis of at least one predicate formula, then there exists at least one predicate formula with this fruit synthesis as the framework synthesis, which defines a set of variable positions in the fruit synthesis as key variable positions. In this case, in the variable positions of the generative part of the analytic expression connected to this fruit synthesis, the concepts on the variable positions corresponding to the key variable positions of the fruit synthesis should not represent the "to be determined" reasoning method.

[0035] In the said classification-comprehensive correspondence relationship, if the synthesis formula is a provable synthesis formula, it means that there is a classification-comprehensive correspondence relationship between the analytical formula and each canonical synthesis formula represented by the provable synthesis formula.

[0036] As a further improvement, the knowledge base device can also be used for reasoning calculation; the knowledge base device also includes a reasoning calculation module; the reasoning calculation module performs reasoning calculation based on the units of the mind map module, and creates or deletes the mind map module units according to the following method to record the process or results of the reasoning calculation;

[0037] The mind map module also includes a type of unit used in the reasoning process, called the reasoning result unit, referred to as the reasoning result; the second step of the thinking method of applying analytical storage to obtain the reasoning result is the generation step, that is, based on the knowledge obtained in the screening step or the knowledge that "existing knowledge cannot be found based on specific conditions", the knowledge implied or partially implied is generated, which is implemented as follows: the reasoning calculation module confirms that the reasoning result of the generated knowledge is already stored in the mind map module, otherwise it creates the reasoning result of the generated knowledge; to simplify the expression, "confirm the existence..." is used to represent "confirm the existence..., otherwise create..."; the reasoning result includes a group of variable bits and a variable sequence composed of the concepts on this group of variable bits sorted by the variable bit names; the reasoning result obtained based on an analytical formula has a group of variable bits corresponding to the result synthesis formula connected to the analytical formula; the reasoning The computing module performs a synthesis process on the inference results to obtain a standard synthesis formula; the syntax and context of the standard synthesis formula obtained by the synthesis process are the same as the result synthesis formula connected by the analytical formula, and its variable positions correspond to the variable positions of the result synthesis formula, and its variable sequence is obtained as follows: the inference results of the analytical formula connected to the same result synthesis formula are divided into a group; in each group of inference results, all possible combinations are found so that in each combination, all inference results have and only have one non-"pending" concept at the corresponding variable position, and these non-"pending" concepts are sorted by variable position name to obtain a variable sequence, and the variable sequence is the variable sequence of a standard synthesis formula obtained by the synthesis process; at this time, the core attributes stored in the inference result include: a grouping mark, a group of variable positions, and a variable sequence; the grouping mark of the inference result obtained from an analytical formula is the result synthesis formula connected by the analytical formula;

[0038] The process of the inference calculation module performing inference calculation is composed of transaction units; the execution of the transaction unit is triggered by the mind map module unit marked with a state; the states include newly created, newly deleted, and to be integrated; the transaction unit is divided into generation transaction unit and deletion transaction unit; the generation transaction unit is triggered and executed by the mind map module unit marked with a newly created or to be integrated state; when the specific step of the generation transaction unit needs to delete a mind map module unit, it is not deleted directly, but only marked with a newly deleted state; in all transaction units, all the operation steps of "the inference calculation module finds...the mind map module unit" ignore the mind map module unit marked with a newly deleted state; when a specific step of a transaction unit confirms the existence of a mind map module unit marked with a newly deleted state, its newly deleted state is canceled; when a specific step of a transaction unit creates a new mind map module unit, it is marked with a newly created state; the deletion transaction unit is triggered and executed by the mind map module unit marked with a newly deleted state, and the unit is actually deleted in the transaction unit; the mind map module unit marked with a state is immediately deleted after the execution of the corresponding transaction unit is triggered. Loss of state; for the mind map module units that do not exist in the knowledge base device when the reasoning starts, the reasoning calculation module records the process of their being confirmed by the generated transaction unit; the execution of the generated transaction unit is triggered by a mind map module unit marked with a state, which is called a trigger unit, and it may confirm the existence of multiple mind map module units, each of which is called a confirmation unit; the reasoning calculation module records the process of a generated transaction unit confirming the existence of a group of mind map module units as a group of proof relationships; the proof relationship is a type of mind map module unit that the reasoning calculation module needs to use when performing reasoning calculations, and its stored core attributes include a trigger unit and a confirmation unit; a proof relationship is said to be supported by its trigger unit and owned by its confirmation unit; for all mind map module units that do not exist at the beginning of the reasoning, after a transaction unit is completed, if they lose all the proof relationships they have, they are marked with a new deletion state; when the reasoning calculation module actually deletes a mind map module unit, all the proof relationships supported by the unit are deleted at the same time; the proof relationship itself is not deleted because it does not have a proof relationship, nor is it marked with a state, and is deleted immediately when it needs to be deleted;

[0039] When a hypothesis synthesis formula marks a newly created state, the execution generation transaction unit is triggered: the hypothesis synthesis formula is denoted as H; first, all the proof relations supported by H are deleted; then, the reasoning calculation module finds all the analytical formulas that may confirm the existence of reasoning results that meet the meaning of H; for each of them, denoted as Ah, the reasoning calculation module reversely obtains a screening condition, denoted as Fa, based on the reasoning method represented by the generating part of Ah, so that the canonical synthesis formula obtained by the screening of Fa may obtain the reasoning result that meets the meaning of H after applying the thinking method of Ah; if Fa meets the meaning of the screening part of Ah, then it is confirmed that there is a hypothesis synthesis formula, denoted as Ha, and the context and syntactic form of Ha are the same as those of the cause synthesis formula of Ah, and its variable sequence table is It shows Fa, creates a proof relationship (H, Ha) at the same time, and confirms that there is an association between Ha and Ah, which is called an evidence-based association; the evidence-based association is a type of mind map module unit that the reasoning calculation module needs to use when performing reasoning calculations. Its stored core attributes include: a hypothesis synthesis formula and an analysis formula; the evidence-based association Sah describes the evidence-based association between Ha and Ah and creates a proof relationship (H, Sah); then, the reasoning calculation module finds all the sub-synthesis mapping formulas in which Ah participates, and for each of them, it is recorded as Ma, and Ma describes the sub-synthesis mapping relationship between the analysis formula Ah and the synthesis formula Ta. If the meaning of Ta does not contradict Fa, then it is confirmed that there is a hypothesis synthesis formula, recorded as Ht, whose context and syntactic formula are consistent with T a is the same, and its variable sequence represents the meaning of Ta restricted by Fa. At the same time, a proof relationship (H, Ht) is created, and it is confirmed that there is an association between Ma, Ht and Ah, which is called a deformation association; the deformation association is also a type of mind map module unit that the reasoning calculation module needs to use when performing reasoning calculations. Its stored core attributes include: a classification and synthesis mapping formula, a hypothesis synthesis formula, and an analysis formula; the deformation association Cmha describes the deformation association between Ma, Ht and Ah, and creates a proof relationship (H, Cmha); then, the reasoning calculation module finds all the predicate formulas of H that match its meaning, and for each of them, it is recorded as Ph. If Ph is associated with the task execution system or data query system connected to the reasoning calculation module, The reasoning calculation module then executes the task or queries the data, and confirms that there is a set of standard synthesis formulas that store the task results or required data. For each of them, denoted as Nh, a proof relationship (H, Nh) is created; the analytical formula may confirm the existence of an inference result that conforms to the meaning of the hypothesis synthesis formula. One judgment method is that the result synthesis formula connected by the analytical formula is syntactically equivalent to the hypothesis synthesis formula and has the same context, and the variable sequence of the analytical formula generation part and the variable sequence of the hypothesis synthesis formula satisfy the following conditions at the corresponding variable positions: 1) the concept of the hypothesis synthesis formula is "to be determined", or 2) the concept of the hypothesis synthesis formula is not "to be determined" and the concept of the generation part represents a non-"known" reasoning method, or 3) the concept of the hypothesis synthesis formula is not "to be determined" and is the same as the concept of the generation part;The screening conditions are deduced based on the analytical formula, so that the standard comprehensive formula obtained after screening may obtain the reasoning result that conforms to the meaning of the hypothesis comprehensive formula after applying the thinking method stored in the analytical formula. One implementation is that the screening conditions are recorded as a variable sequence, and its variable bits are recorded to correspond to the variable bits of the screening part of the analytical formula. At this time, since the variable bits of the analytical formula generation part are associated with the variable bits of the screening part in the source relationship, the variable bits of the analytical formula generation part are also associated with the variable bits of the screening conditions; the concept of each variable bit of the screening condition is determined by the following method: the variable bits of the hypothesis comprehensive formula correspond to the variable bits of the generation part; for each pair of corresponding variable bits, if the concept of the hypothesis comprehensive formula is not "to be determined" and the generated part is The concept of the part represents the "reference" reasoning method, then the concept on the screening condition variable position associated with the generated part variable position is equal to the concept of the hypothesis synthesis formula. For the screening condition variable position whose concept cannot be determined according to the method described, the concept on it is equal to the non-"pending" concept on its corresponding screening part variable position. If the concept on its corresponding screening part variable position is "pending", then the concept on it is "arbitrary"; a judgment method for the said screening condition to meet the meaning of the analytical screening part is that the screening condition variable sequence and the analytical screening part variable sequence have the same concept on the corresponding variable position or the concept of the screening part is "arbitrary"; the hypothesis synthesis formula variable sequence represents a realization of the screening condition, and the hypothesis synthesis formula The variable sequence is obtained by replacing "arbitrary" with "to be determined" in the variable sequence of the screening condition; a method for judging whether the meaning of the comprehensive formula is not inconsistent with the screening condition is that the score-comprehensive correspondence relationship contains the concept of the same relationship between the i-th variable position of the analytical formula screening part and the j-th variable position of the comprehensive formula, and for each group i and j, it satisfies: 1) the concept on the j-th variable position of the comprehensive formula is not "to be determined", and the concept on the i-th variable position of the screening condition is the same as it or "arbitrary", or 2) the concept on the j-th variable position of the comprehensive formula is "to be determined"; the variable sequence of the hypothesis comprehensive formula represents the meaning of the comprehensive formula that has a comprehensive-comprehensive mapping relationship with the analytical formula after being restricted by the screening condition, and one implementation is , the variable sequence of the hypothesis synthesis formula is obtained as follows: 1) For each set of i and j mentioned above, if the concept on the j-th variable position of the synthesis formula is "to be determined" and the concept on the i-th variable position of the screening condition is "arbitrary", then the concept on the j-th variable position of the hypothesis synthesis formula is "to be determined", 2) At the same time, for each set of i and j mentioned above, if the concept on the j-th variable position of the antipodal synthesis formula is "to be determined" and the concept on the i-th variable position of the screening condition is not "arbitrary", then the concept on the j-th variable position of the hypothesis synthesis formula is the same as the concept on the i-th variable position of the screening condition, 3) The concept on the variable position of the hypothesis synthesis formula that cannot be determined according to the above method is equal to the concept on the corresponding variable position of the antipodal synthesis formula;

[0040] When an analysis formula is marked with a newly created or newly deleted state, the corresponding transaction unit is triggered to execute. The following operations are performed in both the creation and deletion transaction units: the analysis formula is denoted as A; the reasoning calculation module finds hypothetical synthesis formulas that may confirm the existence of reasoning results that match the analysis formula A, and marks these hypothetical synthesis formulas with a newly created state;

[0041] When an evidence-based association is marked with a newly created state, the execution of the generated transaction unit is triggered (as shown in Figure 1, which describes the operation of step 22 of the specific implementation case below): the evidence-based association is denoted as S, which describes the evidence-based association between the hypothesis synthesis formula H and the analytical formula A. First, all the proof relationships supported by S are deleted. Then, the reasoning calculation module finds the standard synthetic formulas that meet the meaning of H, and denotes their set as E. If A is a positive analytical formula, E is used as the basis for applying the thinking method stored in A. If E is an empty set and A is a negative analytical formula, H is used as the basis for applying the thinking method stored in A. Based on the above basis, the reasoning calculation module applies the thinking method stored in A to confirm the existence of each reasoning result. For each reasoning result, denoted as Rs, a proof relationship (S, Rs) is created.

[0042] When a transformation association is marked with a newly created state, the execution of the generation transaction unit is triggered (as shown in FIG2 , which describes the operation of step 27 of the specific implementation case below): the transformation association is denoted as C, which describes the transformation association of the sub-synthesis mapping formula M, the hypothesis synthesis formula H, and the analytical formula A. First, all proof relationships supported by C are deleted. Then, the canonical synthesis formula that meets the meaning of H is found. For each of them, denoted as Nt, the reasoning calculation module confirms the existence of an analytical formula whose cause synthesis formula and effect synthesis formula are the same as A, and its screening part and generation part variable sequence is the variable sequence obtained after the screening part and generation part variable sequence of A are partially replaced with the concepts in Nt according to the concept identity relationship described by M. The analytical formula is denoted as At, and the proof relationship (C, At) is created.

[0043] When a canonical synthesis marks a newly created or newly deleted state, the corresponding transaction unit is triggered to execute. The following operations are performed in the creation or deletion transaction unit: the canonical synthesis is denoted as N; the reasoning calculation module finds N hypothetical synthesis that conforms to its meaning. For each of these hypothetical synthesis, denoted as Hn, the reasoning calculation module finds the evidence-based association in which Hn participates and marks it as a newly created state; the reasoning calculation module finds the deformation association in which Hn participates and marks it as a newly created state.

[0044] When a reasoning result is marked with a newly created or newly deleted state, the corresponding transaction unit is triggered to execute. The following operations are performed in the creation or deletion transaction unit: the reasoning result is denoted as R, and its group is marked as a comprehensive type G; G is marked as a pending comprehensive state;

[0045] When a synthesis formula is marked with the pending synthesis state, the execution generation transaction unit is triggered (as shown in Figure 3, which describes the 24th operation of the specific implementation case below): the synthesis formula is denoted as N; first, the proof relationship supported by N is deleted; then, the reasoning calculation module finds all the reasoning results grouped as N and executes the above-mentioned synthesis process on them; the reasoning calculation module confirms the existence of the standard synthesis formula obtained by the synthesis process, and for each of them, denoted as Nc, creates a proof relationship (N, Nc).

[0046] As a further improvement, the knowledge base device creates various types of mind map module units based on sequences composed of symbols representing specific concepts to store the knowledge and thinking methods represented by these symbol sequences. The knowledge base device assigns different codes to different sequences, which are called sequence codes; assigns a code to globally distinguish these positions to each position in each sequence, which is called a position code; uses the sequence code as the identity form code of the mind map module unit and the position code as the form code of the concept; and records the symbol sequence based on which these units are created while creating the mind map module units.

[0047] As a further improvement, the knowledge base device creates various mind map module units based on the natural language text in the form of a symbol sequence entered by the user, and responds to the thinking goals specified by the user in the form of a natural language text in the form of a symbol sequence;

[0048] The knowledge base device records the symbol sequence based on which the mind map module units are created while creating these units, which is implemented as follows: the knowledge base device also includes an auxiliary module to store natural language text in the form of symbol sequence entered by the user; a text block representing a specific concept in the natural language text is a symbol; a natural language sentence is a sequence composed of symbols, and the symbol sequence corresponds to a concept sequence obtained by arranging the concepts represented by each symbol in the sequence according to their symbol order; natural language text is organized in articles, and the articles include an original text symbol sequence, referred to as the original text sequence, and a group of interpretation symbol sequences, referred to as the interpretation sequence; the original text sequence refers to the text used when communicating through natural language; the interpretation sequence refers to the text representation of the semantic structure, knowledge and thinking method that needs to be known in advance in order to understand the meaning expressed by the text; the interpretation sequence includes syntactic sequence, comprehensive sequence, and analytical sequence, which explain the semantic structure , knowledge and thinking methods are stored in the syntactic, comprehensive and analytical forms of the mind map module respectively; at the same time, specific subsequences of the original text sequence also constitute sentences that explain the semantic structure, knowledge and thinking methods, and the contents described by these subsequences of the original text sequence are also stored in the syntactic, comprehensive and analytical forms; as mentioned above, the knowledge base device assigns a sequence code to each sequence and a position code to each position of each sequence; the knowledge base device creates a mind map module unit based on these codes; at the same time, the knowledge base device uses a type of symbol unit in its auxiliary module to store text block symbols, a type of position unit to store the association between a position code and the symbol appearing at the position it represents, and a type of article unit to record the position code arrangement corresponding to the original text sequence and the interpretation sequence of the article; at the same time, the knowledge base device supplements the record in its mind map module unit with the position code arrangement corresponding to the symbol sequence based on which the unit is created;

[0049] The knowledge base device responds to the thinking goals provided by the user in the form of natural language text in the form of a symbol sequence, which is implemented as follows: when reporting a comprehensive formula, the knowledge base device refers to a symbol sequence, which is called the reference sequence of this comprehensive formula; a reference sequence refers to a symbol sequence in which any variable position of the comprehensive formula can establish a one-to-one correspondence with its variable position, and this type of symbol sequence includes the syntactic sequences or original sequence subsequences corresponding to all equivalent syntactic forms of the syntactic form of the comprehensive formula; the knowledge base device keeps the symbols in the reference sequence that do not correspond to the variable positions of the comprehensive formula unchanged, and replaces the symbols corresponding to the variable positions of the comprehensive formula with any symbol that can represent the concept on the variable position.

[0050] As a further improvement, the knowledge base device uses the following types of codes: using the formal code of a type of mind map module unit to indicate that a group of such units is included in the mind map module, and the attributes of this group of such units use the formal code, so the identity code of this group of such units is also a formal code; using the substantial code of a type of mind map module unit to indicate that a group of such units is included in the mind map module, and the attributes of this group of such units only use the substantial code, so the identity code of this group of such units is also a substantial code; the knowledge base device uses the following types of codes and corresponding types of units;

[0051] locf: Global position code / concept form code; if a symbol at a specific position in a sequence of accurately understood symbols refers to a concept, it must refer to a unique concept; symbols at different sequence positions may refer to the same concept; therefore, the global position code is also the formal code of the concept;

[0052] stxf: code / syntactic formula for a syntactic sequence or a subsequence of a textual sequence that describes a semantic structure; a syntactic sequence or a subsequence of a textual sequence that describes a semantic structure corresponds to a unique syntactic formula; different syntactic sequences or subsequences of textual sequences that describe a semantic structure may correspond to the same syntactic formula; therefore, the code for a syntactic sequence or a subsequence of a textual sequence that describes a semantic structure is also a formal code for the syntactic formula;

[0053] synf: Code / synthesis formula formal code / grouping mark substantive code for a synthesis sequence or a subsequence of a textual sequence that explains knowledge; a synthesis sequence or a subsequence of a textual sequence that explains knowledge corresponds to a unique synthesis formula; different synthesis sequences or subsequences of textual sequence that explain knowledge may correspond to the same synthesis formula; therefore, the code for a synthesis sequence or a subsequence of a textual sequence that explains knowledge is also the formal code for the synthesis formula; on the other hand, each synthesis statement derived through reasoning in the original article must have its complete reasoning path. If the synthesis statement is derived from the synthesis of partial reasoning results obtained from multiple reasoning paths, the synthesis statement uniquely indicates the grouping mark when the partial reasoning results obtained from this group of reasoning paths are synthesized. Therefore, the synthesis sequence code, subsequence code of the textual sequence, and synthesis formula code representing the knowledge derived through reasoning are also the substantive codes for the grouping mark;

[0054] anaf: code of an analysis sequence or a subsequence of a textual sequence explaining a thinking method / formal code of an analysis formula; a subsequence of an analysis sequence or a subsequence of a textual sequence explaining a thinking method corresponds to a unique analysis formula; different subsequences of analysis sequences or subsequences of textual sequences explaining a thinking method may correspond to the same analysis formula; therefore, the code of a subsequence of an analysis sequence or a subsequence of a textual sequence explaining a thinking method is also the formal code of the analysis formula;

[0055] prdf: predicate-based formal code;

[0056] stxef: formal code for syntactic equivalence;

[0057] synef: formal code for analogical equivalents;

[0058] cptef: formal code of substantial equivalence;

[0059] asef: the form code of the comprehensive mapping type;

[0060] stxs: the substantive code of the syntactic formula;

[0061] ctxs: the actual code of the context;

[0062] cpts: the substantive code of the concept;

[0063] syns: comprehensive substantive code;

[0064] anas: analytical substantive code;

[0065] prds: predicate-type substance code;

[0066] ases: the content code of the sub-comprehensive mapping type;

[0067] seks: substantive code for evidence-based association;

[0068] tfms: deformation related substance code;

[0069] ress: the substantive code of the inference result.

[0070] As a further improvement, the workflow of the knowledge base device is as follows:

[0071] The first step is to acquire and store knowledge, thinking methods, and thinking goals; the mind map module of the knowledge base device receives the natural language text in the form of a symbol sequence entered by the user, assigns a sequence code and a position code to each symbol sequence and each position therein, uses the sequence code as the form code of the mind map module unit, and uses the position code as the form code of the concept; creates a mind map module unit based on these form codes, wherein the mind map module unit is a form unit and its identity code is a shape code;

[0072] The second step is to start the reasoning calculation; the reasoning calculation module of the knowledge base device starts the reasoning calculation according to the user's instructions. First, the preparation work of the reasoning calculation is completed, that is, the substantial units of all the mind map module units are obtained. The method is as follows;

[0073] First, based on the essential equivalence formula, for all formal codes representing concepts with an essential equivalence relationship, create the essential codes of the concepts they represent, and record the formal code-essential code mapping relationship of the codes representing the concepts. The formal code-essential code mapping relationship of the codes representing the concepts is called the concept mapping relationship.

[0074] Then, based on the analogical equivalent, a common contextual substantive code is created for all the comprehensive form codes with analogical equivalent relationships, and the mapping relationship between the comprehensive form code and the contextual substantive code is recorded; the mapping relationship between the comprehensive form code and the contextual substantive code is called the comprehensive context mapping relationship;

[0075] Then, based on the syntactic equivalence, the order of the variable positions of the syntactic expressions with syntactic equivalence is unified, and the comparison relationship of the variable position orders before and after the unification is recorded. A syntactic substantive code is created for the formal codes of all syntactic expressions with syntactic equivalence, and the substantive code is used to represent the unified variable position order, thereby creating syntactic substantive units. The formal code-substantive code comparison relationship of the syntactic expressions and the variable position correspondence relationship between the syntactic formal units and the substantive units are recorded. The formal code-substantive code comparison relationship of the syntactic expressions and the variable position correspondence relationship between the syntactic formal units and the substantive units of the syntactic expressions are referred to as syntactic comparison relationships.

[0076] Then, based on the aforementioned concept mapping, syntactic mapping, and comprehensive context mapping, the attributes represented by the comprehensive form code are converted into attributes represented by the substantive code, a comprehensive substantive code is assigned to each different attribute, and a comprehensive substantive unit is created; the comprehensive form code-substantive code mapping relationship is recorded; and the comprehensive form code-substantive code mapping relationship is referred to as the comprehensive mapping relationship.

[0077] Then, based on the aforementioned conceptual, comprehensive, and syntactical comparisons, the attributes of the analytical formula represented by the formal code are converted into attributes represented by the substantive code, and each different attribute is assigned an analytical formula substantive code to create an analytical formula substantive unit; the analytical formula formal code-substantive code comparison is recorded; and the analytical formula formal code-substantive code comparison is referred to as the analytical formula comparison relationship.

[0078] Then, based on the aforementioned comprehensive, syntactic, and analytical contrast relationships, the attributes of the comprehensive mapping formula represented by the formal code are converted into attributes represented by the substantive code, and a comprehensive mapping formula substantive code is assigned to each different attribute to create a comprehensive mapping formula substantive unit; the formal code-substantive code contrast relationship of the comprehensive mapping formula is recorded;

[0079] Then, based on the aforementioned comprehensive and syntactic comparison relationships, the attributes of the predicate expressed in formal codes are converted into attributes expressed in substantive codes. A predicate substantive code is assigned to each different attribute to create a predicate substantive unit. The formal code-substantive code comparison relationship of the predicate is recorded.

[0080] In the third step, the reasoning calculation module performs reasoning calculation according to the aforementioned steps based on the substantial units in the mind map module; at the beginning of reasoning, the substantial units corresponding to the formal units of the hypothesis synthesis entered by the user are marked as newly created; during the reasoning process, when a standard synthesis that meets the meaning of the hypothesis synthesis entered by the user is created, found or deleted, the reasoning calculation module immediately reports to the user: the reasoning calculation module follows the aforementioned steps, based on the correspondence between the formal units and the substantial units of the mind map module units, finds available reference sequences and symbols that can represent specific concepts, and constructs a natural language text in the form of a symbol sequence to report to the user.

[0081] Beneficial effects of the present invention:

[0082] 1. Allows the representation of knowledge and thinking methods based on natural language text, with strong representation capabilities, easy to understand and use; supports the gradual integration of knowledge represented in different languages; and supports the establishment of large knowledge bases through gradual integration;

[0083] 2. Collaboratively represent knowledge and thinking methods in an interconnected manner, so that the results of reasoning and computation can further drive new reasoning and computation processes, achieving autonomous thinking; during the reasoning and computation process, new information can be actively acquired on demand;

[0084] 3. When the contents of the mind map in the knowledge base are consistent with the facts, the process of reasoning and calculation is based on the facts, and the results of reasoning and calculation must also reflect the facts;

[0085] 4. Known knowledge, thinking methods, and new knowledge generated by reasoning can all be reported in the form of natural language text. The reasoning process is clear and explainable, which facilitates manual proofreading and correction of the knowledge base. BRIEF DESCRIPTION OF THE DRAWINGS

[0086] Figure 1 is an example diagram of a transaction unit for newly created evidence-based association-triggered execution;

[0087] FIG2 is an example diagram of a transaction unit for triggering execution of a newly created deformation association;

[0088] FIG3 is an example diagram of a transaction unit to be integrated and grouped to mark the integrated trigger execution;

[0089] FIG4 is an example diagram of a mind map module unit entered by a user;

[0090] Figures 5-7 are diagrams of data records formed in the database during the reasoning process of the embodiment of this patent.

[0091] Specific implementation cases

[0092] The following are merely illustrative embodiments of the present invention and are not intended to limit the present invention. Those skilled in the art will readily appreciate that various modifications and variations of the present invention are possible. Any modifications, equivalent substitutions, or improvements made within the spirit and principles of the present invention are intended to be within the scope of protection of the present invention.

[0093] The following describes an embodiment of a knowledge base device in software form. This embodiment uses a data table of a relational database to implement the aforementioned mind map module unit and auxiliary module unit. The primary key of the data table is the identity code of the unit, and the other fields of the data table are the attributes of the unit. The following conventions are explained:

[0094] 1) Capital letters indicate table names or field names; a field with a last letter C indicates a field, and a field with an asterisk indicates a primary key; a table with a last letter F indicates a data table, and the table only uses formal codes or other codes or information to represent a mind map module unit, which is called a formal table; a table with a last letter S indicates a data table, and the table only uses substantial codes or other codes or information to represent a mind map module unit, which is called a substantial table; a table with a last letter M indicates a data table, and the table uses both formal codes and substantial codes or other codes or information to represent a mind map module unit, which is called a comparison table; a table with a last letter X indicates a data table, and the table represents an auxiliary module unit; the formal code field in the comparison table is the primary key of the table;

[0095] 2) Lowercase letter marks indicate codes; a code ending with an f indicates that the code is a formal code for the identity of a mind map module unit; a code ending with an s indicates that the code is a substantive code for the identity of a mind map module unit; a code ending with an x ​​indicates that the code is a code for the identity of an auxiliary module unit;

[0096] 3) Lowercase letters starting with an underscore indicate other information that is not a code;

[0097] 4) With "XXXF(AAAC*:aaaf,BBBSC: <bbbf>,ZZZC:_zzz,…)” format describes the structure of a data table, where XXXF is the table name; AAAC, BBBSC, and ZZZC are field names; the AAAC field with an asterisk indicates the primary key; _zzz indicates a specific type of non-code information; "<>" indicates a sequence. <bbbf>Represents a sequence of bbbf type codes; the content stored in the field is described in the form of "field: code or sequence or other information";

[0098] 5) Mixed-case letters represent records in a data table;

[0099] 6) Use the "[]" operator to represent the search, in the form of "XXXF[AAAC=aaaf]" to represent the records obtained by searching the data table using specific conditions, which can be one or more records;

[0100] 7) Use the ".." operator to retrieve a field from a data record. When the operator is preceded by a single record, the value of a single field is retrieved. When the operator is preceded by a group of data records, the set of field values ​​from all records is retrieved.

[0101] 8) Use the "()" operator to extract sequence elements by order;

[0102] 9) Use Len(<>) to indicate the length of the sequence;

[0103] 10) Use "{}" to represent the value of a data table record. The values ​​of each field in {} are arranged in the order of the fields in the data table definition;

[0104] 11) Use "Convert to Substantial Code" to perform the following operations: For a specific formal code, find the record containing the specific formal code in the comparison table with the formal code of that type as the primary key, and extract the substantive code field of the record;

[0105] 12) If the arrangement of a sequence of codes representing a concept follows a specific form of a syntactic formula, that is, follows the order of the "i-th variable position" used in the field description of the data record in the following syntactic formula form table, the concept code sequence is said to be arranged in a formal order; if the arrangement follows the essence of a syntactic formula, that is, follows the order of the "i-th variable position" used in the field description of the data record in the following syntactic formula essence table, the concept code sequence is said to be arranged in a substantive order; "arrange in substantive order" is used to represent the following operation: for a specific concept code sequence, the code that follows the syntactic form of its arrangement is recorded as stxf; in the following STXM table, find the record with stxf as the primary key value, whose variable position name comparison field provides information on the correspondence between the i-th variable position of the syntactic form and the j-th variable position of the syntactic essence, and adjust the arrangement order of the concept code sequence based on this information;

[0106] 13) "Substantiation" refers to the following operations: if the object being substantiated is a formal code, convert it to a substantive code; if the object being substantiated is a sequence of formal codes, convert each element of the sequence to a substantive code and then arrange the sequence in substantive order;

[0107] 14) Since the aforementioned variable positions are all 1st…nth, there is no need to record the variable positions themselves in the data table; only the corresponding relationship between the variable positions needs to be recorded. This design applies to the design of all the following data tables and will not be repeated here.

[0108] The knowledge base device uses the aforementioned mind map module codes locf, stxf, synf, anaf, prdf, stxef, synef, cptef, asef, stxs, ctxs, cpts, syns, anas, prds, ases, seks, tfms, ress, and the following types of auxiliary module codes:

[0109] 1)symx: symbol / text block code;

[0110] 2)artx: article code;

[0111] 3) setx: a code for a set consisting of a set of concepts. A set itself is not a concept. A set concept refers to a set.

[0112] The knowledge base device uses the following types of information other than code:

[0113] 1) _txt: the content of the symbol / text block, which is represented in the database as a serialized form of a generalized text block such as a string or image;

[0114] 2)_ind: The position in the sequence, represented as an integer in the database. The first sequence is 1, and invalid sequences are 0. Positive and negative integers are used to represent the sequence positions of two different sequences in the same sequence.

[0115] 3)_typ: type of synthesis, which has three possible values: canonical synthesis, provable synthesis, and hypothetical synthesis, denoted by N, P, and H respectively;

[0116] 4)_mod: the type of the analysis, which has two possible values: positive analysis and negative analysis, represented by P and N respectively;

[0117] 5)_sta: the status of the mind map module unit, which has three possible values: newly created, newly deleted, and to be integrated;

[0118] The knowledge base device uses the following data tables:

[0119] 1) SYMX (IDC*:symx, TXTC:_txt): SYMX, text block content table; IDC, symbol code field; TXTC, text content field; a record indicates that a text block with specific content corresponds to a specific symbol code; this table is modified when the knowledge base device receives a symbol sequence: if a text block with specific content is not in this table, a record in this table is created;

[0120] 2) LOCF (IDC*:locf, SYMC:symx): LOCF, global position symbol table; IDC, global position code field; SYMC, symbol field; a record indicates that a specific symbol appears at a specific global position; this table is modified when the knowledge base device receives a symbol sequence: the knowledge base device creates a global position code for each position in each received symbol sequence that is distinguishable from all positions in all sequences, finds the symbol code for the text content appearing at that position in the SYMX table, creates it if it does not exist, and records in this table that the symbol appears at that global position;

[0121] 3) ARTX (ARTC:artx, INDC:_ind, LOCC*:locf): ARTX, article sequence table; ARTC, article field; INDC, ordinal field; LOCC, global position field; one record indicates that global position locf is associated with article artx; if _ind is not 0, locf is the position in the original article sequence, and _ind is the rank of the global position in the original article sequence; if _ind is 0, locf is the position in the article interpretation sequence; the aforementioned knowledge base device creates comprehensive formulas describing task execution results or data query results based on the task execution system or data query system associated with the predicate formula. These comprehensive formulas are also created based on the symbol sequences returned by the task execution system or data query system. These symbol sequences are also considered to be the interpretation sequences of the articles to which the predicate formula belongs; this table is modified when the knowledge base device receives the symbol sequence, and the text block at the global position locf is SYMX[IDC=LOCF[IDC=locf].SYMC].TXTC;

[0122] 4)STXF(IDC*:stxf,ARTC:artx,SYMSC: <locf>,VARSC: <locf>): STXF, syntactic form table; IDC, code field; ARTC, article field; SYMSC, text block global position sequence field; VARSC, variable bit global position sequence field; a record indicates that in the article artx, a syntactic sequence or a subsequence of the original sequence represents a syntactic form, which share the syntactic form code stxf; the sequence consists of a set of global positions, which are stored in the SYMSC field; the global position of the corresponding variable bit in the sequence is stored in the VARS field <locf>In this syntactic representation, the i-th variable position corresponds to the global position <locf>(i); This table is modified when the knowledge base device receives a syntactic sequence or a subsequence of a textual sequence representing a syntactic expression;

[0123] 5)SYNF(IDC*:synf,ARTC:artx,STXC:stxf,VALSC: <locf>,TYPC:_typ,SYMSC: <locf>): SYNF, comprehensive form table; IDC, code field; ARTC, article field; STXC, syntactic field; VALSC, variable sequence field; TYPC, type field; SYMSC, text block global position sequence field; a record indicates that in the article artx, a comprehensive sequence or a subsequence of the original sequence represents a comprehensive form, which share the comprehensive form code synf; the sequence is the source sentence of the comprehensive form, composed of a set of global positions, and stored in the SYMSC field; the meaning of the source sentence can be represented by the syntactic representation form stxf, when this form is used, the global position of the source sentence text block corresponding to its variable bit is arranged in the order of the variable bit name and stored in the VALSC field; the type of the comprehensive form is _typ; this table is modified when the knowledge base device receives a comprehensive sequence or a subsequence of the original sequence representing the comprehensive form;

[0124] 6)ANAF(IDC*:anaf,ARTC:artx,CSYNC:synf,RSYNC:synf,FVALSC: <locf>,GVALSC: <locf>,SRCC: <locf>,TYPC:_mod,SYMSC: <locf>):ANAF, analytical form table; IDC, code field; ARTC, article field; CSYNC, cause synthesis field; RSYNC, result synthesis field; FVALSC, screening part variable sequence field; GVALSC, generation part variable sequence field, SRCC, source relationship field; TYPC, type field; SYMSC, text block global position sequence field; a record indicates that in the article artx, an analysis sequence or source sequence subsequence represents an analytical formula, which share the analytical form code anaf; the sequence is the source statement of the analytical formula, consisting of a set of global positions, Stored in the SYMSC field; a form of the cause synthesis of the analysis is the synf of the CSYNC field; a form of the result synthesis of the analysis is the synf of the RSYNC field; the global position corresponding to the variable bit of the analysis screening part in the source statement is arranged in the order of the variable bit of the syntactic form of this form of the cause synthesis, and the resulting sequence is stored in the FVALSC field; the global position corresponding to the variable bit of the analysis generation part in the source statement is arranged in the order of the variable bit of the syntactic form of this form of the result synthesis, and the resulting sequence is stored in the GVALSC field; the SRCC field describes the source relationship, which <locf>With GVALSC field <locf>The same length, and its components are FVALSC fields <locf>An element of the SRCC field or a code indicating an invalid global position. <locf>for <slocf>, remember the GVALSC field <locf>for <glocf>, remember the FVALSC field <locf>for <flocf>; Source relationship <slocf>illustrate, <glocf>The i-th position association <flocf>Appears in <slocf>(i) position, if <slocf>(i) is an invalid global position, then there is no associated position; the type of the analysis formula is _mod; this table is modified when the knowledge base device receives the analysis sequence or the original sequence subsequence representing the analysis formula;

[0125] 7) PRDF(IDC*:prdf,FSYNC:synf,KEYSC:<_ind>): PRDF, predicate form table; IDC, code field; FSYNC, framework synthesis field; KEYSC, key variable bit field; one record indicates that, in the framework synthesis form synf, its variable sequence is represented as the concept form code sequence SYNF[IDC=synf].VALSC, in which the key variable bits are arranged in order of size to obtain <_ind>; this table is modified when the knowledge base device receives the input comprehensive statement structure knowledge;

[0126] 8) STXEF(IDC*:sxef,XSTXC:stxf,YSTXC:stxf,MAPC:<_ind>): STXEF, syntactic equivalence form table; IDC, code field; XSTXC, equivalent syntactic form field one; YSTXC, equivalent syntactic form field two; MAPC, variable bit name comparison field; one record indicates that the two stxfs of the XSTXC field and the YSTXC field have an equivalence relationship, and the values ​​of these two fields are recorded as stxxf and stxyf respectively; the i-th variable bit in the syntactic form stxyf corresponds to the <_ind>(i)-th variable bit in the syntactic form stxxf; syntactic forms with an equivalence relationship are said to have the same syntactic substance; this table is modified when the knowledge base device receives the entered syntactic equivalence relationship;

[0127] 9) SYNEF(IDC*:synef,XSYNC:synf,YSYNC:synf): SYNEF, analog equivalent form table; IDC, code field; XSYNC, equivalent comprehensive form field 1; YSYNC, equivalent comprehensive form field 2; one record indicates that the source statement context of the comprehensive forms represented by the two synf fields in the XSYNC and YSYNC fields is the same; this table is modified when the knowledge base device receives the input analog equivalent relationship;

[0128] 10) CPTEF (IDC*:cptef, XCPTC:locf, YCPTC:locf): CPTEF, substantial equivalence form table; IDC, code field; XCPTC, equivalent concept one field; YCPTC, equivalent concept two field; one record indicates that the symbols at the global positions indicated by the two locfs in the XCPTC and YCPTC fields represent the same concept; this table is modified when the knowledge base device receives an input substantial equivalence relationship;

[0129] <h2 style=";text-align:left;direction:ltr">11)ASEF(IDC*:asef,ANAC:anaf,SYNC:synf,RPLC:<h2 style=";text-align:left;direction:ltr"> <locf>): ASEF, the table of sub-synthesis mapping forms; IDC, the code field; ANAC, the analysis field; SYNC, the synthesis field; RPLC, the replacement relationship field; a record indicates that there is a sub-synthesis mapping relationship between the analysis form anaf and the synthesis form synf, and the RPLC field indicates the replacement relationship; record the RPLC field of the ASEF table record <locf>for <rlocf> ； <rlocf>The same length as the global position code sequence of the SYNF[IDC=synf].VALSC field, which is recorded as <slocf> ； <rlocf>and <slocf>The sequence of the FVALSC and GVALSC fields in the ANAF [IDC = anaf] record is equal in length and its constituent elements are the constituent elements of the global position code sequence of the FVALSC and GVALSC fields in the ANAF [IDC = anaf] record or a code indicating an invalid global position. The sequence of the FVALSC and GVALSC fields in the record is recorded as <aflocf> 、 <aglocf>; Replacement relationship <rlocf>illustrate, <slocf>The i-th variable position is replaced <aflocf> 、 <aglocf>Appears in <rlocf>(i) position, if <rlocf>(i) If it is an invalid global position, there is no replacement position; this table is modified when the knowledge base device receives the input sub-comprehensive mapping relationship;

[0130] 12) STXM (SSTXC: stxs, FSTXC*: stxf, MAPC: <_ind>): STXM, syntax comparison table; SSTXC, substance code field; FSTXC, form code field; MAPC: variable bit name comparison field; one record indicates that the syntax represented by the syntax form stxf has the substance code stxs, and the syntaxes with equivalent relations have the same substance code; <_ind> indicates that the variable bit name "i" used in the data record field definition of the syntax form corresponds to the variable bit name "<_ind>(i)" used in the description of the attribute (i.e., syntax substance) of the syntax; in the preparation stage of the inference calculation, the knowledge base is loaded Generate the content of this table: 1) Use the set Eq to record the records of the STXEF table that have been processed; use the set Tdo to record the syntactic form code to be processed; 2) If Tdo is empty, take out a record that is not in the Eq set in the STXEF table, record its XSTXC field as stxif, create a substance code for the form code stxif, record it as stxis, create an integer sequence from 1 to Len(STXF[IDC=stxif].VARSC), record it as <_ordi>, indicating that the variable bit name of the syntactic substance corresponds to the variable bit name of the syntactic form in the same name correspondence; create a record in this table {stxis,stxif,<_ordi> >}; record stxif in the Tdo set; 3) if Tdo is not empty, remove one of the codes and record it as stxaf; then, find the syntactic equivalence relation composed of stxaf, that is, the union of the record set STXEF[XSTXC=stxaf] and the record set STXEF[YSTXC=stxaf]; after removing the records in Eq from the set, for each record in it, record it as Rec, perform the following operation: 3.1) if Rec.YSTXC is equal to stxaf, then record Rec.XSTXC as stxbf, otherwise record Rec.YSTXC as stxbf; because the syntactic expressions are equivalent, the substantive code of the syntactic expression represented by stxbf is the same as that represented by stxaf The syntactic form of the same substantive code is denoted as stxas and can be obtained through STXM[FSTXC=stxaf].SSTXC. In this case, the data record STXM[FSTXC=stxaf] describes the name correspondence between the variable bits of the syntactic form stxaf and the variable bits of the syntactic substantive stxas in the MAPC field. The data record Rec describes the correspondence between the variable bits of the syntactic form stxaf and the variable bits of the syntactic form stxbf in the MAPC field. Based on these two correspondences, the correspondence between the variable bits of the syntactic form stxbf and the variable bits of the syntactic substantive stxas can be obtained, denoted as <_ordb>. 3.2) If STXM[FSTXC=stxbf] does not exist, create the table record {stxas,stxbf,<_ordb>} and record stxbf in the Tdo set; 3.3) Record Rec in the Eq set; 4) Repeat steps 2)-3) above until no further steps are possible; 5) Remove the syntactic form codes that appear in the IDC field of the STXF table from the syntactic form codes that appear in the FSTXC field of this table. For each remaining syntactic form code, record it as stxjf; create a substantive code for the form code stxjf, record it as stxjs; create a sequence of integers from 1 to Len(STXF[IDC=stxjf].VARSC), record it as <_ordj>; and create the table record {stxjs,stxjf,<_ordj>}.

[0131] 13) CTXM (SCTXC: ctxs, FSYNC*: synf): CTXM, context table; SCTXC, context field; FSYNC, comprehensive field; a record indicates that the context of the comprehensive synf can be represented by the substantial code ctxs; in the preparation stage of the inference calculation, the knowledge base device generates the content of the table: 1) construct a graph data structure, whose nodes are all codes appearing in the IDC field of the SYNF table, and whose edges correspond to the records of the SYNEF table, connecting the codes of its XSYNC field and the codes of its YSYNC field; 2) calculate all the maximum connected subgraphs in the graph, and nodes without edges are regarded as being in the single-node subgraph they constitute; 3) for each maximum connected subgraph, denoted as Gr, create a context substantial code, denoted as ctxrs, and for each node in Gr, denoted as synrf, create a record {ctxrs,synrf} of this table;

[0132] 14) CPTM (CPTC: cpts, LOCC*: locf): CPTM, concept mapping table; CPTC, concept field; LOCC, global location field; one record indicates that the concept essence code cpts and the global location / concept form code locf represent the same concept; in the preparation stage of the reasoning calculation, the knowledge base device generates the content of this table: 1) Build a graph data structure, whose nodes are all codes appearing in the IDC field of the LOCF table, and whose edges correspond to the records of the CPTEF table, connecting the codes of its XCPTC field and the codes of its YCPTC field; 2) Calculate all the maximum connected subgraphs in the graph, and nodes without edges are regarded as being in the single-node subgraph they constitute; 3) For each maximum connected subgraph, denoted as Gr, create a concept essence code, denoted as cptrs, and for each node in Gr, denoted as locrf, create a record {cptrs, locrf} of this table;

[0133] 15)SYNS(IDC*:syns,STXC:stxs,CTXC:ctxs,VALSC: <cpts>,TYPC:_typ,STAC:_sta): SYNS, comprehensive substance table; IDC, code field; STXC, syntax field; CTXC, context field; VALSC, concept sequence field; TYPC, type field; STAC, status label field; a record is a comprehensive formula represented by a substance code, including its identity code, attributes, and status; in the preparation stage of the reasoning calculation, the knowledge base device generates the initial content of this table; at the beginning of the reasoning calculation, the knowledge base device changes the STAC field of this table record with the substance code of the hypothesis comprehensive formula entered by the user as the primary key to the newly created; in the reasoning process, the knowledge base The device uses this table as a comprehensive record table; the initial content of this table is obtained by materializing the records of the SYNF table, and a record in the SYNF table is denoted as Rec, and the comprehensive form code of its IDC field is denoted as synrf; the materialization operation on this record refers to: materializing the syntactic form code of Rec.STXC to obtain the syntactic form code, denoted as stxrs; looking up the context form code CTXM[FSYNC=Rec.IDC].SCTXC of the comprehensive form in CTXM, denoted as ctxrs; the arrangement order of the conceptual form code sequence of Rec.VALSC follows the syntactic form Rec.STXC, denoted as <locrf>, which is materialized into a conceptual material code sequence, recorded as <cptrs>, and record the corresponding relationship between the positions before and after rearrangement in the process of materialization, which is recorded as <_indr>. This correspondence indicates that <locrf>The i-th position in becomes <cptrs>The <_indr>(i)th position in the table; Rec.TYPC remains unchanged in the materialization operation and is recorded as _typr; the STAC fields of the initial records in the SYNS table are all empty values, indicating an unmarked state; the knowledge base device confirms that there is a field in this table except the IDC field. The other fields are stxrs, ctxrs, <cptrs>, _typr, null, record its IDC field as synrs; add the record {synrs,synrf,<_indr>} in the following SYNM;

[0134] 16) SYNM (SSYNC: syns, FSYNC*: synf, MAPC: <_ind>): SYNM, comprehensive formula comparison table; SSYNC, substance code field; FSYNC, form code field; MAPC, position comparison field; one record indicates that the substance code syns and the form code synf of the comprehensive formula represent the same comprehensive formula, and the positional correspondence between the concept sequence represented by the form code of the comprehensive formula form synf recorded in the SYNF table and the concept sequence represented by the substance code of the comprehensive formula substance syns recorded in the SYNS table is <_ind>; in the preparation stage of the inference calculation, the knowledge base device generates the contents of this table when generating the initial contents of the SYNS table;

[0135] 17)ANAS(IDC*:anas,CSYNC:syns,RSYNC:synf,FVALSC: <cpts>,GVALSC: <cpts>,MAPC:<_ind>,TYPC:_mod,STAC:_sta): ANAS, analytical expression entity table; IDC, code field; CSYNC, cause synthesis field; RSYNC, result synthesis field; FVALSC, screening department concept sequence field; GVALSC, generation department concept sequence field, MAPC, source relationship field; TYPC, type field; STAC, status mark field; a record is an analytical expression represented by an entity code, including its identity code, attributes, and status; in the preparation stage of reasoning calculation, the knowledge base device generates the initial content of this table; in the process of reasoning calculation, the knowledge base device uses this table as the record table of analytical expressions; the initial content of this table is generated by the records of the ANAF table through the entity code. The ANAF table is obtained by the analytic operation, and a record in the ANAF table is recorded as Rec, and the analytical form code of its IDC field is anarf; the substantialization operation on the record means that the comprehensive form codes of Rec.CSYNC and Rec.RSYNC are recorded as csynrf and rsynrf, and they are substantialized to obtain comprehensive substantial codes, recorded as csynrs and rsynrs; the syntactic form codes of these two comprehensive forms are found in the STXC field of the record with csynrs and rsynrs as the primary key in the SYNF table, and are recorded as cstxrf and rstxrf. At this time, the screening part concept sequence and the generation part concept sequence represented by the concept form code sequence in Rec.FVALSC and Rec.GVALSC are recorded as <flocrf> 、 <glocrf>The code arrangement order in them follows the syntax cstxrf and rstxrf respectively. By materializing them, we can get the screening part concept sequence and the generating part concept sequence represented by the concept substance code sequence, which are recorded as <fcptrs> 、 <gcptrs>, and record the position correspondence before and after rearrangement in the process of materialization of the two concept sequences, and record them as <_findr>, <_gindr>; <_findr> means, <flocrf>The i-th position in becomes <fcptrs>In the <_findr>(i)th position, <_gindr> indicates that <glocrf>The i-th position in becomes <gcptrs>The <_gindr>(i)th position in the Rec.SRCC field; based on the correspondence between these two positions and the <flocrf> 、 <glocrf>The position correspondence between them is expressed as <fcptrs> 、 <gcptrs>The position correspondence between the order sequence, recorded as <_sind>; <_sind> and <gcptrs>Equal length, indicating <gcptrs>The i-th position in <fcptrs>The <_sind>(i)th position in the Rec.TYPC is unchanged in the materialization operation and is recorded as _modr; the STAC fields of the initial records in the ANAS table are all empty values, indicating an unmarked state; the knowledge base device confirms that there is a record in this table. In addition to the IDC field, the other fields are csynrs, rsynrf, <fcptrs> 、 <gcptrs>, <_sind>, _modr, null, record its IDC field as anars; add the record {anars, anarf, <_findr>, <_gindr>} to the following analysis comparison table;

[0136] 18) ANAM (SANAC: anas, FANAC*: anaf, FMAPC: <_ind>, GMAPC: <_ind>): ANAM, analytic expression comparison table; SANAC, substance code field; FANAC, form code field; FMAPC, screening part position comparison field; GMAPC, generation part position comparison field; one record indicates that the substance code anas and form code anaf of the analytic expression represent the same analytic expression; the positional correspondence between the screening part concept sequence and generation part concept sequence represented by the form code of the analytic expression form anaf recorded in the ANAF table and the screening part concept sequence and generation part concept sequence represented by the substance code of the analytic expression substance anas recorded in the ANAS table are respectively <_ind> of the FMAPC field and <_ind> of the GMAPC field; in the preparation stage of the inference calculation, the knowledge base device generates the contents of this table when generating the initial contents of the ANAS table;

[0137] 19)PRDS(IDC*:prds,FSYNC:syns,KEYSC:<_ind>): PRDS, predicate substance table; IDC, code field; FSYNC, framework synthesis field; KEYSC, key variable bit field; a record is a predicate represented by a substance code, including its identity code, attributes, and status; in the preparation stage of the inference calculation, the knowledge base device generates the initial content of this table; the initial content of this table is obtained by the substance operation of the record of the PRDF table, and a record in the PRDF table is denoted as Rec, and the analytical form code of its IDC field is prdrf; performing the substance operation on it means denoting the framework synthesis form code of Rec.FSYNC as fsynrf, and substituting it to obtain the framework synthesis substance code, denoted as fsynrs; denoting the concept sequence represented by the substance code in the SYNS table record with fsynrs as the primary key as <fcptrs>; The concept sequence represented by the form code in the SYNF table record with the comprehensive form fsynrf as the primary key is <flocrf>, the position of fsynrf in the SYNM table record with it as the primary key is referenced by the field <_mindr>. At this time, the sequence of the Rec.KEYSC field is <_findr>. The sequence in <_findr> indicates <flocrf>The position of the key variable bit in <_mindr> indicates the <flocrf>and <fcptrs>The position correspondence between them is obtained based on <_findr> and <_mindr> <fcptrs>The order of the key variable bits in the table is sorted by size to obtain an order sequence, which is recorded as <_sindr>; the knowledge base device confirms that there is a record in this table whose other fields, in addition to the IDC field, are fsynrs and <_sindr>; the IDC field is recorded as prdrs; and the record {prdrs, prdrf} is added to the following predicate comparison table;

[0138] 20) PRDM (SPRDC: prds, FPRDC*: prdf): PRDM, predicate expression comparison table; SPRDC, substance code field; FPRD, form code field; one record indicates that the predicate expression's substance code prds and form code prdf represent the same analytical expression; in the preparatory stage of inference calculation, the knowledge base device generates the contents of this table when generating the initial contents of the PRDS table;

[0139] 21)ASES(IDC*:ases,ANAC:anas,SYNC:syns,MAPC:<_ind>):ASES, comprehensive mapping type entity table; IDC, code field; ANAC, analytical type field; SYNC, comprehensive type field; MAPC, replacement relation field; a record is a comprehensive mapping type represented by an entity code, including its identity code, attributes, and status; in the preparation stage of reasoning calculation, the knowledge base device generates the initial content of this table; the initial content of this table is obtained by the substantialization operation of the record of the ASEF table, and a record in the ASEF table is denoted as Rec, and the comprehensive mapping type form code of its IDC field is aserf; performing substantialization operation on it means denoting the analytical type form code and comprehensive type form code in Rec.ANAC and Rec.SYNC as anarf and synrf, and substantializing them into analytical type entity code and comprehensive type entity code, denoted as anars and synrs; denoting the screening part concept sequence and the generating part concept sequence represented by the entity code in the ANAS table record with anars as the primary key as <afcptrs> 、 <agcptrs>, let synrs be the concept sequence represented by the substantive code in the SYNS table record with synrs as its primary key. <scptrs>; The filter concept sequence and the generation concept sequence represented by the form code in the ANAF table record with the analytical form anarf as the primary key are <aflocrf> 、 <aglocrf>The concept sequence represented by the form code in the position comparison field record of the SYNF table with the comprehensive form synrf as its primary key is <slocrf>; The filter position reference field and the generation position reference field in the ANAM table record with the analytical form anarf as the primary key are <_afmindr> and <_agmindr>, and the position reference field in the SYNM table record with the comprehensive form synrf as the primary key is <_smindr>; At this time, the RPLC field of Rec describes <slocrf>and <aflocrf> 、 <aglocrf>The position correspondence between the two, <_smindr> indicates <slocrf>and <scptrs>The position correspondence between the two, <_afmindr> indicates <aflocrf>and <afcptrs>The position correspondence between the two, <_agmindr> indicates <aglocrf>and <agcptrs>According to these position correspondences, we can get <scptrs>and <afcptrs> 、 <agcptrs>The position correspondence between them is recorded as <_indr>, which means: <scptrs>The i-th position of corresponds to: 1) when <_indr>(i) is a positive integer, <afcptrs>2) When <_indr>(i) is a negative integer, its absolute value is |<_indr>(i)|. <agcptrs>The <_indr>(i)th position in <indr>When (i) is 0, it does not correspond to <aglocrf> 、 <agcptrs>The knowledge base device confirms that there is a record in this table in which the other fields except the IDC field are anars, synrs, and <_indr>; the IDC field is recorded asers; and a record {asers, aserf} is added to the following sub-synthesis mapping table;

[0140] 22) ASEM (SASEC:ases, FASEC*:asef): ASEM, sub-synthesis mapping table; SASEC, substance code field; FASEC, form code field; one record indicates that the sub-synthesis mapping with the substance code ases and the form code asef represents the same sub-synthesis mapping; in the preparation stage of the inference calculation, the knowledge base device generates the contents of this table when generating the initial contents of the ASES table;

[0141] 23) SEKS (IDC*:seks, HYPC:syns, ANAC:anas, STAC:_sta): SEKS: Evidence-based association substance table; IDC, code field; HYPC, hypothesis synthesis field; ANAC, analysis field; STAC, status tag field; a record is an evidence-based association represented by a substance code, including its associated hypothesis synthesis and analysis, as well as the status of the evidence-based association; during the reasoning process, the knowledge base device uses this table as a record table for evidence-based associations;

[0142] 24) TFMS (IDC*: tfms, ASEC: ases, HYPC: syns, ANAC: anas, STAC: _sta): TFMS, variant association substance table; IDC, code field; ASEC, subsynthesis mapping field; HYPC, hypothesis synthesis field; ANAC, analysis field; STAC, status tag field; a record is a variant association represented by a substance code, including its associated subsynthesis mapping, hypothesis synthesis, analysis, and the status of the variant association; during the reasoning process, the knowledge base device uses this table as a record table for variant associations;

[0143] 25)RESS(IDC*:ress,GRPC:syns,VALSC: <cpts>,STAC:_sta): RESS, reasoning result substance table; IDC, code field; GRPC, grouping mark comprehensive field; VALSC, concept sequence field; STAC, status label field; a record is a reasoning result represented by a substance code, including its grouping mark comprehensive formula, concept sequence, and the status of the reasoning result; during the reasoning process, the knowledge base device uses this table as a record table of the reasoning result;

[0144] 26)SETX(IDC*:setx,ITMSC: <cpts>): SETX, set composition table; IDC, code field; ITMSC, composition concept field; a record indicates that the set setx defined by its elements includes a group of concepts, whose essential codes are arranged in order of size. <cpts>; During the reasoning process, the knowledge base device uses this table to record the concept set generated by the "set" reasoning method;

[0145] 27) ENSS (CPTC*:cpts,SETC:setx): ENSS set concept essence table; CPTC, concept field; SETC, set field; one record indicates that the concept essence code cpts refers to the set setx; during the reasoning process, the knowledge base device uses this table to record the referential relationship between the set concept generated by the "set" reasoning method and the specific concept set;

[0146] 28) EVDS (SUPC:anys, HASC:anys): EVDS, Evidence Substance Table; SUPC, Supported Field; HASC: Owned Field; A record indicates the existence of a piece of evidence that is supported by the Mind Map Module Unit anys in the SUPC field and owned by the Mind Map Module Unit anys in the HASC field; anys refers to a non-specific category of Mind Map Module Unit; During the reasoning process, the knowledge base device uses this table to record proof relationships; since proof relationships are not attributes of any other Mind Map Module Unit, there is no need to record their identity codes;

[0147] After starting reasoning, the knowledge base device uses the aforementioned mind map module unit substance table to perform reasoning calculations; the reasoning calculation module operates the data records in the substance table according to the aforementioned method; and reports the results required by the user;

[0148] When the knowledge base device reports a comprehensive formula based on the substance code, it is recorded as syns; its syntactic substance code is stxs, and its concept sequence is <cpts>;remember <cpts>The i-th element in is cptis; the set of formal codes that represent the same syntactic form as the syntactic form substance code stxs can be obtained through STXM[SSTXC=stxs].FSTXC, which is called the equivalent syntactic form set, and a code in this set is denoted as stxjf; a reference sequence that can be used to represent the comprehensive form syns is STXF[IDC=stxjf].SYMSC, which is based on the global position code representation and can be converted into a text block sequence through the LOCF table and the SYMX table; the variable position of the comprehensive form syns, that is, <cpts>The correspondence between the order in the sequence and the order in the text block sequence can be obtained based on STXM[FSTXC=stxjf].MAPC and STXF[IDC=stxjf].VARSC; the form code set of the comprehensive form entered by the user using the syntactic form stxjf can be obtained by SYNF[STXC=stxjf].IDC, which is called the equivalent comprehensive form set, and a code in the set is synkf; a reference sequence that can be used to represent the comprehensive form syns is SYNF[IDC=synkf].SYMSC, which is based on the global position code representation and is obtained through the LOCF table and The SYMX table can convert it into a text block sequence; the correspondence between the variable position of the comprehensive formula syns and the order position of the text block sequence can be obtained based on STXM[FSTXC=stxjf].MAPC, STXF[IDC=stxjf].VARSC, SYNF[IDC=synkf].VALSC; on the other hand, the text block used to represent the concept cptis can be obtained through SYMX[IDC=LOCF[IDC=CPTM[CPTC=cptis].LOCC].SYMC].TXTC; based on the above reference sequence and concept text block options, the synthesized text block sequence is reported to the user.

[0149] Specific knowledge base device use cases

[0150] In the following case, the knowledge base device uses the following 6 special locf codes to represent 6 special concepts: i) 1: to be determined; ii) 2: arbitrary; iii) 3: reference; iv) 4: set; v) 5: decomposition; vi) 6: reflection.

[0151] The following describes a use case of the knowledge base device. In this case, a user reads an article, understands it, and instructs the knowledge base device to create a database table structure.

[0152] The article the user reads is:

[0153] On the first day of school, faculty and staff need to undergo physical examinations for some indicators. Some of the test results are as follows: Zhang San's fasting blood sugar is 7.8mmol / L, Li Si's fasting blood sugar is 8.2mmol / L, and Wang Wu's fasting blood sugar is 6.9mmol / L. The diagnostic limit for fasting blood sugar is 7.0mmol / L. If the fasting blood sugar value of a faculty member is greater than the diagnostic limit, the faculty member is diagnosed with diabetes based on the fasting blood sugar. If the faculty member does not have a 2-hour postprandial blood sugar test result, he has not done a 2-hour postprandial blood sugar test, which may lead to misdiagnosis. In this case, it is recommended that faculty and staff conduct a supplementary 2-hour postprandial blood sugar test. These people need to submit a new examination application to the school medicine department. Which faculty and staff need to submit a new examination application to the school medicine department?

[0154] The article contains the following comprehensive sentences. Based on these comprehensive sentences, the user enters the original text sequence subsequence:

[0155] 1) Zhang San's fasting blood sugar is 7.8mmol / L

[0156] 2) Li Si's fasting blood sugar is 8.2mmol / L

[0157] 3) Wang Wu's fasting blood sugar is 6.9mmol / L

[0158] 4) The diagnostic limit for fasting blood glucose is 7.0 mmol / L

[0159] 5) Faculty and staff fasting blood glucose values ​​("If the faculty and staff fasting blood glucose value is greater than the diagnostic limit")

[0160] 6) Fasting blood glucose diagnostic limit ("If the faculty member's fasting blood glucose value is greater than the diagnostic limit")

[0161] 7) The diagnostic cutoff value of the faculty member's fasting blood glucose value ("If the faculty member's fasting blood glucose value is greater than the diagnostic cutoff value")

[0162] 8) The value is greater than the diagnostic limit ("If the fasting blood glucose value of the faculty member is greater than the diagnostic limit")

[0163] 9) If the fasting blood glucose value of the faculty member is greater than the diagnostic limit

[0164] 10) The faculty member was diagnosed with diabetes based on fasting blood sugar

[0165] 11) The faculty member does not have a 2-hour postprandial blood glucose test result

[0166] 12) He did not do a 2-hour blood sugar test

[0167] 13) The faculty member was diagnosed with diabetes based on their fasting blood glucose, but they did not perform a 2-hour postprandial blood glucose test ("The faculty member was diagnosed with diabetes based on their fasting blood glucose. If the faculty member does not have a 2-hour postprandial blood glucose test result, then they did not perform a 2-hour postprandial blood glucose test").

[0168] 14) The faculty member was diagnosed with diabetes based on their fasting blood sugar. They did not perform a 2-hour postprandial blood sugar test, which could have led to a misdiagnosis. ("The faculty member was diagnosed with diabetes based on their fasting blood sugar. If the faculty member does not have a 2-hour postprandial blood sugar test result, they did not perform a 2-hour postprandial blood sugar test, which could have led to a misdiagnosis.")

[0169] 15) In this case, it is recommended that faculty and staff conduct additional blood sugar checks 2 hours after meals.

[0170] 16) These people need to submit a new examination application to the school hospital

[0171] 17) Which faculty and staff need to submit new examination applications to the school hospital?

[0172] The syntactic sequences of the syntactic patterns created by users based on their understanding of the article include:

[0173] 1) The test results are indicators of faculty and staff

[0174] 2) The indicator for faculty and staff is the test results

[0175] 3) The threshold of the indicator is the diagnostic limit value

[0176] 4) The indicator for faculty and staff is the test result, and its threshold is the diagnostic limit value

[0177] 5) There is a relationship between the test results and the diagnostic cut-off value

[0178] 6) The indicator of faculty and staff is the test result, and its threshold is the diagnostic limit value. There is a relationship between the two.

[0179] 7) Faculty and staff are diagnosed based on indicators

[0180] 8) Faculty and staff were not inspected

[0181] 9) Faculty and staff were diagnosed based on indicators and not examined

[0182] 10) This situation refers to: faculty and staff are diagnosed based on indicators and are not examined

[0183] 11) In this case, it is recommended that faculty and staff conduct a recommended inspection

[0184] 12) People need to submit a new examination application to the school medical department

[0185] The analytical analysis sequence created by the user based on his understanding of the article includes:

[0186] 1) If a faculty member's indicator is a test result, then the faculty member's indicator is the test result and this indicator has a diagnostic limit value

[0187] 2) If the threshold of the indicator is the diagnostic limit value, then the indicator of the faculty member is the test result and this indicator has the diagnostic limit value

[0188] 3) If the indicator of the faculty member is a test result and the indicator has a diagnostic limit value, then the indicator of the faculty member is the test result and the indicator has the diagnostic limit value, and there is a relationship between the indicator and the test result.

[0189] 4) If there is a relationship between the test result and the diagnostic cutoff value, then the faculty member's indicator is the test result and the indicator has the diagnostic cutoff value and there is a relationship between the test result and the indicator.

[0190] 5) If a faculty member has a fasting blood sugar test result and it is greater than the diagnostic limit, the faculty member is diagnosed with diabetes based on this indicator.

[0191] 6) If there is no test result for a faculty member’s indicator, then the faculty member has not undergone the test.

[0192] 7) If a faculty member is diagnosed based on an indicator, then the faculty member is diagnosed based on that indicator and no examination is performed.

[0193] 8) If the faculty member did not undergo the examination, the faculty member was diagnosed based on the indicator and did not undergo the examination

[0194] 9) If a faculty member is diagnosed based on an indicator and no examination is performed, this means that the faculty member is diagnosed based on the indicator and no examination is performed.

[0195] 10) If the situation refers to: the faculty member is diagnosed based on the indicators and has not undergone examination, in this case, the faculty member is encouraged to undergo the recommended examination

[0196] 11) If faculty and staff are encouraged to undergo recommended examinations in this situation, they will need to submit a new examination application to the school hospital.

[0197] The user creates a data table structure through the following steps, as shown in Figure 4:

[0198] 1) The user divides the natural language text block and enters the original text sequence, original text sequence subsequence, and interpretation sequence. Based on the above sequences entered by the user, the knowledge base device creates 74 records in SYMX (see the first 74 records of the SYMX table in FIG5 ), 365 records in LOCF (see the first 365 records of the LOCF table in FIG6 ), and 365 records in the ARTX table (see the first 365 records of the ARTX table in FIG5 ). Based on the syntactic sequence annotated by the user, the knowledge base device creates 12 records in STXF (see the STXF table in FIG6 ). Based on the analysis sequence annotated by the user, the knowledge base device creates 11 records in ANAF (see the ANAF table in FIG7 ). Based on the comprehensive sequence annotated by the user, the knowledge base device creates 17 records in SYNF (see the SYNF table in FIG6 ).

[0199] 2) Based on the original text knowledge understanding, the user marks the predicate on the original text sequence, and the knowledge base device creates a record in the PRDF according to the user's annotation (see Figure 6 PEDF table for details);

[0200] 3) Based on the original text knowledge understanding, the user marks the classification and synthesis correspondence between the original text sequence and the interpretation sequence. The knowledge base device creates two records in ASEF according to the interpretation sequence marked by the user (see the ASEF table in Figure 6 for details);

[0201] 4) Based on the original text knowledge comprehension, the user marks fields in the original text sequence and the interpretation sequence as equal to the same concept. The knowledge base device creates 95 records in CPTEF based on the interpretation sequence marked by the user (see the first 95 records of the CPTEF table in FIG7 ). Based on the original text knowledge comprehension, the user marks sentences in the original text sequence and the interpretation sequence as equal to the same concept. The knowledge base device creates 1 record in STXEF based on the interpretation sequence marked by the user (see the STXEF table in FIG6 ).

[0202] 5) Based on the original text knowledge understanding, the user annotates the original text sequence with a comprehensive sequence with context. The knowledge base device creates 16 records in SYNEF according to the interpretation sequence annotated by the user (see Figure 6 SYNEF table for details);

[0203] In the preparation stage of inference calculation, the knowledge base device generates the following data table content:

[0204] 6) The knowledge base device establishes the association between the concept form code and the substantive code, and creates 106 records in the CPTM (see the first 106 records of the CPTM table in Figure 7 for details);

[0205] 7) The knowledge base device establishes the association between the syntactic form code and the substantive code, and creates 12 records in STXM (see Figure 5 STXM table for details);

[0206] 8) The knowledge base device builds a graph data structure, generates the context code corresponding to the comprehensive formula according to SYNEF, and creates 17 records in CTXM (see Figure 5 CTXM table for details);

[0207] 9) The knowledge base device converts the comprehensive form code into a substance code and creates 17 records in SYNS (see SYNS table in FIG7 for details). Based on the newly generated substance code, the knowledge base device establishes an association between the comprehensive form code and the substance code and creates 17 records in SYNM (see SYNM table in FIG5 for details).

[0208] 10) The knowledge base device converts the analytical form code into a substantive code, creating 11 records in ANAS (see the ANAS table in Figure 7 for details). Based on the newly generated substantive code, the knowledge base device establishes an association between the analytical form code and the substantive code, creating 11 records in ANAM (see the ANAM table in Figure 7 for details).

[0209] 11) The knowledge base device converts the predicate form code into a substance code and creates a record in the PRDS (see Figure 7 for details). Based on the newly generated substance code, the knowledge base device establishes an association between the predicate form code and the substance code and creates a record in the PRDM (see the PRDM table in Figure 5 for details).

[0210] 12) The knowledge base device converts the sub-comprehensive mapping formal code into a substance code and creates two records in ASES (see Figure 7 for details). Based on the newly generated substance code, the knowledge base device establishes an association between the sub-comprehensive mapping formal code and the substance code and creates two records in ASEM (see Figure 7, ASEM table for details).

[0211] The knowledge base device performs reasoning based on the reasoning goal (hypothesis synthesis) proposed by the user:

[0212] 13) When hypothesis synthesis formula 660 is marked with the newly created state, the execution transaction unit is triggered and immediately loses its state after the transaction unit is executed: all proof relationships supported by 660 are deleted, and the reasoning calculation module finds an analytical formula 671 that may confirm the existence of a reasoning result that meets the meaning of 660. Because the screening conditions meet the meaning of the screening part of 671, the existence of a hypothesis synthesis formula: {675, 641, 643, <1, 1, 1>, H, newly created} is confirmed. At the same time, the proof relationship (660, 675) is created. The existence of an evidence-based association {676, 675, 671, newly created} is confirmed, and the proof relationship (660, 676) is created.

[0213] 14) Because the hypothesis synthesis formula 675 confirmed in step 13) is marked as newly created, the execution of the transaction unit is triggered and immediately loses its state after execution: all proof relationships supported by 675 are deleted, and the reasoning calculation module finds an analytical formula 670 that may confirm the existence of a reasoning result that meets the meaning of 675. Because the screening conditions meet the meaning of the screening part of 670, the existence of a hypothesis synthesis formula is confirmed: {677, 640, 643, <1, 1, 1, 1>, H, newly created}. At the same time, a proof relationship (675, 677) is created. The existence of an evidence-based association {678, 677, 670, newly created} is confirmed, and a proof relationship (675, 678) is created.

[0214] 15) Because the hypothesis synthesis formula 677 confirmed in step 14) is marked as newly created, the execution of the transaction unit is triggered and immediately loses its state after execution: all proof relationships supported by 677 are deleted, and the reasoning calculation module finds an analytical formula 669 that may confirm the existence of a reasoning result that meets the meaning of 677. Because the screening conditions meet the meaning of the screening part of 669, the existence of a hypothesis synthesis formula: {679, 639, 643, <1, 1, 1, 1>, H, newly created} is confirmed, and the proof relationship (677, 679) is created. The existence of an evidence-based association {680, 679, 669, newly created} is also confirmed, and the proof relationship (677, 680) is created.

[0215] 16) Because the hypothesis synthesis formula 679 confirmed in step 15) is marked as newly created, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relationships supported by 679 are deleted, and the reasoning calculation module finds analytical formulas 667 and 668 that may confirm the existence of reasoning results that meet the meaning of 679. For analytical formula 667, since the screening conditions meet the meaning of the screening part, the existence of a hypothesis synthesis formula is confirmed: {681, 637, 643, <1, 1, 1>, H, newly created}. At the same time, the proof relationship (679, 681) is created. The existence of an evidence-based association {682, 681, 667, newly created} is also confirmed, and the proof relationship (679, 682) is created. For analytical formula 668, since the screening conditions meet the meaning of the screening part, it is confirmed that there is a hypothesis synthesis formula: {683,638,643,<1,1>,H,newly created}, and at the same time, a proof relationship (679,683) is created, and it is confirmed that there is an evidence-based association {684,683,668,newly created}, and a proof relationship (679,684) is created.

[0216] 17) Since the hypothesis synthesis formula 681 confirmed in step 16) is marked as newly created, the execution of the transaction unit is triggered and immediately loses its state after execution: all proof relationships supported by 681 are deleted, and the reasoning calculation module finds an analytical formula 665 that may confirm the existence of a reasoning result that meets the meaning of 681. Because the screening conditions meet the meaning of the screening part, the existence of a hypothesis synthesis formula: {685, 636, 643, <1, 609, 1, 1, 611>, H, newly created} is confirmed, and the proof relationship (681, 685) is created. The existence of an evidence-based association {686, 685, 665, newly created} is also confirmed, and the proof relationship (681, 686) is created.

[0217] 18) Because the hypothesis synthesis formula 683 confirmed in step 16) is marked as newly created, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relationships supported by 683 are deleted, and the reasoning calculation module finds an analytical formula 666 that may confirm the existence of a reasoning result that meets the meaning of 683. Because the screening condition does not meet the meaning of the screening part of 666, the knowledge base device finds the sub-synthesis mapping formula 674 involved in 666 and confirms the existence of a hypothesis synthesis formula: {687, 637, 643, <1, 612, 610>, H, newly created}, and simultaneously creates the proof relationship (683, 687). At the same time, the existence of a transformation association {688, 674, 687, 666, newly created} is confirmed, and the proof relationship (683, 688) is created.

[0218] 19) Because the hypothesis synthesis formula 685 confirmed in step 17) is marked as newly created, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relationships supported by 685 are deleted, and the reasoning calculation module finds analytical formulas 663 and 664 that may confirm the existence of reasoning results that meet the meaning of 685. For analytical formula 663, since the screening conditions meet the meaning of the screening part, the existence of a hypothesis synthesis formula is confirmed: {689, 634, 643, <1, 609, 1, 1>, H, newly created}. At the same time, the proof relationship (685, 689) is created. The existence of an evidence-based association {690, 689, 663, newly created} is confirmed, and the proof relationship (685, 690) is created. For the analytical formula 664, since the screening condition does not meet the meaning of the screening part of 664, the knowledge base device finds the sub-synthesis mapping formula 673 in which 664 participates, confirms the existence of a recorded hypothesis synthesis formula 689, and confirms the existence of a transformation association {692, 673, 689, 664, newly created}, and creates a proof relationship (685, 692).

[0219] 20) Because the hypothesis synthesis formula 689 confirmed in step 19) is marked as newly created, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relationships supported by 689 are deleted, and the reasoning calculation module finds analytical formulas 661 and 662 that may confirm the existence of reasoning results that meet the meaning of 689. For analytical formula 661, since the screening conditions meet the meaning of the screening part, the existence of a hypothesis synthesis formula is confirmed: {693, 632, 643, <1, 609, 1>, H, newly created}. At the same time, the proof relationship (689, 693) is created. At the same time, the existence of an evidence-based association {694, 693, 661, newly created} is confirmed, and the proof relationship (689, 694) is created. For analytical formula 662, since the screening conditions meet the meaning of the screening part, it is confirmed that there is a hypothesis synthesis formula: {695,633,643,<609,1>,H,newly created}, and at the same time, a proof relationship (689,695) is created. At the same time, it is confirmed that there is an evidence-based association {696,695,662,newly created}, and a proof relationship (689,696) is created.

[0220] 21) Since the evidence-based association 694 in step 20) above marks the newly created state, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all the proof relationships supported by 694 are deleted; then, the reasoning calculation module finds the standard synthesis formulas 644, 645 and 646 that meet the meaning of the hypothesis synthesis formula 693. Since 661 is a positive analysis formula, 644, 645 and 646 are used as the basis for applying the thinking method stored in 661, and Applying the thinking method stored in 661, it is confirmed that there are 3 reasoning result records {697,450,<621,609,622,1>, newly created}, {698,450,<623,609,624,1>, newly created}, {699,450,<625,609,626,1>, newly created} and the corresponding 3 proof relationships (694,697), (694,698), (694,699).

[0221] 22) Since the evidence-based association 696 in step 20) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 696 are deleted; then, the reasoning calculation module finds the standard synthesis formula 648 that conforms to the meaning of the hypothesis synthesis formula 695. Since 662 is a positive analysis formula, 648 is used as the basis for applying the thinking method stored in 662, and the thinking method stored in 662 is applied to confirm the existence of 1 reasoning result record {700,450,<1,609,1,627>, newly created} and a corresponding proof relationship (696,700).

[0222] 23) Since the reasoning result 700 of step 22) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 450 is marked as the pending integration state.

[0223] 24) Since the synthesis formula 450 in step 23) above is marked with the pending synthesis state, the execution transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 450 are deleted, and the reasoning calculation module finds all reasoning results 697, 698, 699 and 700 whose group-marked synthesis formula is 450, performs the synthesis process on them, and confirms the existence of 3 standard synthesis formulas {701, 634, 643, <621, 609, 622, 627>, N, newly created}, {702, 634, 643, <623, 609, 624, 627>, N, newly created}, {703, 634, 643, <625, 609, 626, 627>, N, newly created} and 3 corresponding proof relationships (450, 701), (450, 702), (450, 703).

[0224] 25) Since the specification synthesis formula 701 in step 24) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: the reasoning calculation module finds 701 that the hypothesis synthesis formula 689 is consistent with the meaning. Since 689 participates in the evidence-based association 690 and the deformation association 692, 690 and 692 are marked as newly created states.

[0225] 26) Since the evidence-based association 690 in step 25) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: all the proof relationships supported by 690 are deleted; then, the reasoning calculation module finds the standard synthesis formulas 701, 702 and 703 that conform to the meaning of the hypothesis synthesis formula 689. Since 663 is a positive analysis formula, 701, 702 and 703 are used as the basis for applying the thinking method stored in 663, and 663 is applied. The existing thinking method confirms that there are 3 reasoning result records {704,452,<621,609,622,627,1>, newly created}, {705,452,<623,609,624,627,1>, newly created}, {706,452,<625,609,626,627,1>, newly created} and the corresponding 3 proof relationships (690,704),(690,705),(690,706).

[0226] 27) Since the transformation association 692 in step 25) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 692 describes the transformation association of the sub-synthesis mapping 673, the hypothesis synthesis 689 and the analytical formula 664; first, all the proof relations supported by 692 are deleted; then, the reasoning calculation module finds the standard synthesis formulas 701, 702 and 703 that meet the meaning of 689, and confirms the existence of three analytical formulas {707, 651, 652, <622, 627 ,2>,<1,1,3,3,3>,<0,0,1,2,3>,P},{708,651,652,<624,627,2>,<1,1,3,3,3>,<0,0,1,2,3>,P},{709,651,652,<626,627,2>,<1,1,3,3,3>,<0,0,1,2,3>,P} and create the corresponding proof relationship (692,707), (692,708), (692,709);

[0227] 28) Since the analysis formula 707 in step 27) above marks the newly created state, the execution transaction unit is triggered and the state is lost immediately after the transaction unit is executed: find all 707 possible confirmed existing reasoning results that meet the hypothesis synthesis formula 685 and mark the newly created state.

[0228] 29) Since the hypothesis synthesis formula 685 confirmed in step 28) is marked as newly created, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relationships supported by 685 are deleted. The reasoning calculation module finds analytical formulas 664, 707, 708, and 709 that may confirm the existence of reasoning results that meet the meaning of 685. For analytical formula 707, since the screening conditions meet the meaning of the screening part, the existence of a hypothesis synthesis formula is confirmed: {710, 635, 643, <622, 627, 611>, H, newly created}. At the same time, the proof relationship (685, 710) is created. At the same time, the existence of an evidence-based association {711, 710, 707, newly created} is confirmed, and the proof relationship (685, 711) is created. For analytical formula 708, since the screening conditions meet the meaning of the screening section, a hypothesis synthesis formula is confirmed: {712, 635, 643, <624, 627, 611>, H, newly created}. A proof relationship (685, 712) is created. The existence of an evidence-based association {713, 712, 708, newly created} is also confirmed, and a proof relationship (685, 713) is created. For analytical formula 709, since the screening conditions meet the meaning of the screening section, a hypothesis synthesis formula is confirmed: {714, 635, 643, <626, 627, 611>, H, newly created}. A proof relationship (685, 714) is also created. The existence of an evidence-based association {715, 714, 709, newly created} is also confirmed, and a proof relationship (685, 715) is created.

[0229] 30) Because the hypothesis synthesis formula 710, confirmed to exist in step 29, is marked with a newly created state, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relations supported by 710 are deleted, and a predicate formula 672 that matches 710 is found. Since 672 is associated with the "size comparison" task execution system that can be operated by the knowledge base, the calculation engine returns the symbol sequence <"7.8","7.0","greater than">. New records are created in LOCF, CPTEF, ARTX, and CPTM: primary keys 785-787 for LOCF, primary keys 798, 795, 793 for CPTEF, primary keys 785-787 for ARTX, and primary keys 785-787 for CPTM. The existence of the canonical synthesis formula {716, 635, 643, <622, 627, 611>, N, newly created} describing the task result is confirmed, and the proof relationship (710, 716) is created.

[0230] 31) Because the hypothesis synthesis formula 712, confirmed to exist in step 29, is marked with a newly created state, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relations supported by 712 are deleted, and the predicate formula 672 that matches 712 is found. Since 672 is associated with the "size comparison" task execution system that can be operated by the knowledge base, the calculation engine returns the symbol sequence <"7.2","7.0","greater than">. New records are created in LOCF, CPTEF, ARTX, and CPTM: primary keys 788-790 in LOCF, primary keys 794, 796, and 799 in CPTEF, primary keys 788-790 in ARTX, and primary keys 788-790 in CPTM. The existence of the canonical synthesis formula {717, 635, 643, <624, 627, 611>, N, newly created} describing the task result is confirmed, and the proof relation (712, 717) is created.

[0231] 32) Since the hypothesis synthesis formula 714 confirmed to exist in step 29) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 714 are deleted, and the predicate formula 672 that meets the meaning of 714 is found. Since 672 is associated with the "size comparison" task execution system that can be operated by the knowledge base, the calculation engine returns the symbol sequence <"6.9","7.0","less than">, and the following new records are created in SYMX, LOCF, CPTEF, ARTX and CPTM: primary key 718 of SYMX, primary keys 791, 792, 719 of LOCF, primary keys 797, 800 of CPTEF, primary keys 791, 792, 719 of ARTX, and primary keys 791, 792, 719 of CPTM. And confirm that there is a canonical comprehensive formula {721,635,643,<626,627,720>,N,newly created} that describes the task result, and create a proof relationship (714,721).

[0232] 33) Since the specification synthesis formula 716 in step 30) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 716 the hypothesis synthesis formula 710 that meets the meaning, and since 710 participates in the evidence-based association 711, 711 is marked as a newly created state.

[0233] 34) Since the normative synthesis formula 717 in step 30) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 717 the hypothesis synthesis formula 712 that meets the meaning, and since 712 participates in the evidence-based association 713, 713 is marked as a newly created state.

[0234] 35) Since the evidence-based association 711 in step 33) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 711 are deleted; then, the reasoning calculation module finds the standard synthesis formula 716 that conforms to the meaning of the hypothesis synthesis formula 710. Since 707 is a positive analysis formula, 716 is used as the basis for applying the thinking method stored in 707, and the thinking method stored in 707 is applied to confirm the existence of 1 reasoning result record {722,452,<1,1,622,627,611>, newly created} and a corresponding proof relationship (711,722).

[0235] 36) Since the evidence-based association 713 in step 34) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 713 are deleted; then, the reasoning calculation module finds the standard synthesis formula 717 that conforms to the meaning of the hypothesis synthesis formula 712. Since 708 is a positive analysis formula, 717 is used as the basis for applying the thinking method stored in 708, and the thinking method stored in 708 is applied to confirm the existence of 1 reasoning result record {723,452,<1,1,624,627,611>, newly created} and a corresponding proof relationship (713,723).

[0236] 37) Since the reasoning result 723 of step 36) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 452 is marked as the pending integration state.

[0237] 38) Since the synthesis formula 452 in step 37) above is marked with the pending synthesis state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 452 are deleted, and all reasoning results 704, 705, 706, 722 and 723 with group-marked synthesis formula 452 are found, and the synthesis process is performed on them. It is confirmed that there are two standard synthesis formulas {724, 636, 643, <621, 609, 622, 627, 611>, N, newly created}, {725, 636, 643, <623, 609, 624, 627, 611>, N, newly created} and two corresponding proof relations (452, 724), (452, 725).

[0238] 39) Since the normative synthesis formula 725 in step 38) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 725 the hypothesis synthesis formula 685 that meets the meaning, and since 685 participates in the evidence-based association 686, 686 is marked as a newly created state.

[0239] 40) Since the evidence-based association 686 in step 39) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 686 are deleted; then, the reasoning calculation module finds the standard synthesis formulas 724 and 725 that conform to the meaning of the hypothesis synthesis formula 685. Since 665 is a positive analysis formula, 724 and 725 are used as the basis for applying the thinking method stored in 665, and the thinking method stored in 665 is applied to confirm the existence of 2 reasoning result records {726,453,<621,609,610>, newly created}, {727,453,<623,609,610>, newly created} and the corresponding 2 proof relationships (686,726), (686,727).

[0240] 41) Since the reasoning result 727 of step 40) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 453 is marked as the pending integration state.

[0241] 42) Since the synthesis formula 453 in step 41) above is marked with the pending synthesis state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 453 are deleted, and all reasoning results 726 and 727 with group-marked synthesis formula 453 are found, and the synthesis process is performed on them. It is confirmed that there are two standard synthesis formulas {728,637,643,<621,609,610>,N,newly created}, {729,637,643,<623,609,610>,N,newly created} and two corresponding proof relations (453,728), (453,729).

[0242] 43) Since the normative synthesis formula 729 in step 42) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 729 hypothetical synthesis formula 681 that meets the meaning, and since 681 participates in the evidence-based association 682, 682 is marked as a newly created state.

[0243] 44) Since the evidence-based association 682 in step 43) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 682 are deleted; then, the reasoning calculation module finds the standard synthesis formulas 728 and 729 that conform to the meaning of the hypothesis synthesis formula 681. Since 667 is a positive analysis formula, 728 and 729 are used as the basis for applying the thinking method stored in 667, and the thinking method stored in 667 is applied to confirm the existence of 2 reasoning result records {730,456,<621,609,610,1>, newly created}, {731,456,<623,609,610,1>, newly created} and the corresponding 2 proof relationships (682,730), (682,731).

[0244] 45) Since the transformation association 688 in step 18) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 688 describes the transformation association of the sub-synthesis mapping 674, the hypothesis synthesis 687, and the analysis 666; first, all the proof relationships supported by 688 are deleted; then, the reasoning calculation module finds the standard synthesis 728 and 729 that meet the meaning of 687, and confirms the existence of two analysis formulas {732,654,655,<621,612,2>,<3,3>,<1,2>,N}, {733,654,655,<623,612,2>,<3,3>,<1,2>,N} and creates the proof relationships (688,732), (688,733) corresponding to 2;

[0245] 46) Since the analysis formula 733 in step 45) above marks the newly created state, the execution transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find all 733 possible confirmed existence reasoning results that meet the hypothesis synthesis formula 683 and mark the newly created state.

[0246] 47) Because the hypothesis synthesis formula 683, confirmed to exist in step 46 above, is marked with a newly created state, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: all proof relationships supported by 683 are deleted, and the reasoning calculation module finds analytical formulas 666, 732, and 733 that may confirm the existence of reasoning results that meet the meaning of 683. For analytical formula 732, since the screening conditions meet the meaning of the screening part, the existence of a hypothesis synthesis formula is confirmed: {734, 632, 643, <621, 612, 1>, H, newly created}, and the proof relationship (683, 734) is created. At the same time, the existence of an evidence-based association {735, 734, 732, newly created} is confirmed, and the proof relationship (683, 735) is created. For analytical formula 733, since the screening conditions meet the meaning of the screening part, it is confirmed that there is a hypothesis synthesis formula: {736,632,643,<623,612,1>,H,newly created}, and at the same time, a proof relationship (683,736) is created. At the same time, it is confirmed that there is an evidence-based association {737,736,733,newly created}, and a proof relationship (683,737) is created.

[0247] 48) Since the evidence-based association 735 in step 47) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 735 are deleted; since there is no standard synthesis formula that conforms to the meaning of the hypothesis synthesis formula 734 and 732 is a negative analysis formula, 734 is used as the basis for applying the thinking method stored in 732, and the thinking method stored in 732 is applied to confirm the existence of 1 reasoning result record {738,455,<621,612>, newly created} and a corresponding proof relationship (735,738).

[0248] 49) Since the evidence-based association 737 in step 47) above is marked with a newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relationships supported by 737 are deleted; since there is no standard synthesis formula that meets the meaning of the hypothesis synthesis formula 736 and 733 is a negative analysis formula, 736 is used as the basis for applying the thinking method stored in 733, and the thinking method stored in 733 is applied to confirm the existence of 1 reasoning result record {739,455,<623,612>, newly created} and a corresponding proof relationship (737,739).

[0249] 50) Since the reasoning result 739 of step 49) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: 438 is marked as the pending integration state.

[0250] 51) Since the synthesis formula 455 in step 50) above is marked with the pending synthesis state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 455 are deleted, and all reasoning results 738 and 739 with group-marked synthesis formula 455 are found, and the synthesis process is performed on them. It is confirmed that there are two standard synthesis formulas {740, 638, 643, <621, 612>, N, newly created}, {741, 638, 643, <623, 612>, N, newly created} and two corresponding proof relations (455, 740), (455, 741).

[0251] 52) Since the normative synthesis formula 741 in step 51) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 741 hypothetical synthesis formula 683 that meets the meaning, and since 683 participates in the evidence-based association 684, 684 is marked as a newly created state.

[0252] 53) The evidence-based association 684 in step 52) above is marked with a newly created state, triggering the execution of the transaction unit and losing the state immediately after the execution of the transaction unit: deleting all the proof relationships supported by 684; then, the reasoning calculation module finds the standard synthesis formulas 740 and 741 that conform to the meaning of the hypothesis synthesis formula 683. Since 668 is a positive analysis formula, 740 and 741 are used as the basis for applying the thinking method stored in 668, and the thinking method stored in 668 is applied to confirm the existence of 2 reasoning result records {742,456,<621,1,1,612>, newly created}, {743,456,<623,1,1,612>, newly created} and the corresponding 2 proof relationships (684,742), (684,743).

[0253] 54) Since the reasoning result 743 of step 53) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 456 is marked as the pending integration state.

[0254] 55) Since the synthesis formula 456 in step 54) above is marked with the pending synthesis state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 456 are deleted, and all reasoning results 730, 731, 742 and 743 with grouped marked synthesis formula 456 are found, and the synthesis process is performed on them. It is confirmed that there are two standard synthesis formulas {744, 639, 643, <621, 609, 610, 612>, N, newly created}, {745, 639, 643, <623, 609, 610, 612>, N, newly created} and two corresponding proof relations (456, 744), (456, 745).

[0255] 56) Since the normative synthesis formula 745 in step 55) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 745 the hypothesis synthesis formula 679 that meets the meaning, and since 679 participates in the evidence-based association 680, 680 is marked as a newly created state.

[0256] 57) The evidence-based association 680 in step 56) above is marked with a newly created state, triggering the execution of the transaction unit and losing the state immediately after the execution of the transaction unit: deleting all the proof relationships supported by 680; then, the reasoning calculation module finds the standard synthesis formulas 744 and 745 that conform to the meaning of the hypothesis synthesis formula 679. Since 669 is a positive analysis formula, 744 and 745 are used as the basis for applying the thinking method stored in 669, and the thinking method stored in 669 is applied to confirm the existence of 2 reasoning result records {749,457,<748,621,609,610,612>, newly created}, {753,457,<752,623,609,610,612>, newly created} and the corresponding 2 proof relationships (680,749), (680,753).

[0257] 58) Since the reasoning result 753 of step 57) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 457 is marked as the pending integration state.

[0258] 59) Since the synthesis formula 457 in step 58) above is marked with the pending synthesis state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 457 are deleted, and all reasoning results 749 and 753 with group-marked synthesis formula 457 are found, and the synthesis process is performed on them. It is confirmed that there are two standard synthesis formulas {754,640,643,<748,621,609,610,612>,N,newly created}, {755,640,643,<752,623,609,610,612>,N,newly created} and two corresponding proof relations (457,754), (457,755).

[0259] 60) Since the normative synthesis formula 755 in step 59) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 755 the hypothesis synthesis formula 677 that meets the meaning. Since 677 participates in the evidence-based association 678, 678 is marked as a newly created state.

[0260] 61) The evidence-based association 678 in step 60) above is marked with a newly created state, triggering the execution of the transaction unit and losing the state immediately after the execution of the transaction unit: deleting all the proof relationships supported by 678; then, the reasoning calculation module finds the standard synthesis formulas 754 and 755 that conform to the meaning of the hypothesis synthesis formula 677. Since 670 is a positive analysis formula, 754 and 755 are used as the basis for applying the thinking method stored in 670, and the thinking method stored in 670 is applied to confirm the existence of 2 reasoning result records {758,458,<748,621,612>, newly created}, {759,458,<752,623,612>, newly created} and the corresponding 2 proof relationships (678,758), (678,759).

[0261] 62) Since the reasoning result 759 of step 61) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 458 is marked as the pending integration state.

[0262] 63) Since the synthesis formula 458 in step 62) above is marked with the pending synthesis state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: all proof relations supported by 458 are deleted, and all reasoning results 758 and 759 with group-marked synthesis formula 458 are found, and the synthesis process is performed on them, and it is confirmed that there are two standard synthesis formulas {760,641,643,<748,621,612>,N,newly created}, {761,641,643,<752,623,612>,N,newly created} and two corresponding proof relations (458,760), (458,761).

[0263] 64) Since the normative synthesis formula 761 in step 63) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the execution of the transaction unit: find 761 a hypothesis synthesis formula 675 that meets the meaning, and since 675 participates in the evidence-based association 676, 676 is marked as a newly created state.

[0264] 65) The evidence-based association 676 in step 64) above marks the newly created state, triggering the execution of the transaction unit and immediately losing the state after the transaction unit is executed: deleting all the proof relationships supported by 676; then, the reasoning calculation module finds the standard synthesis formulas 760 and 761 that conform to the meaning of the hypothesis synthesis formula 675. Since 671 is a positive analysis formula, 760 and 761 are used as the basis for applying the thinking method stored in 671, and the thinking method stored in 671 is applied to confirm the existence of one reasoning result record {764,459, <763> , newly created} and the corresponding 1 proof relationship (676,764).

[0265] 66) Since the reasoning result 764 of step 65) above marks the newly created state, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: 459 is marked as the pending integration state.

[0266] 67) Since the synthesis formula 459 in step 66) is marked as pending synthesis, the execution of the transaction unit is triggered and the state is lost immediately after the transaction unit is executed: all proof relations supported by 459 are deleted, and all reasoning results 764 with grouped synthesis formulas marked as 459 are found, and the synthesis process is performed on them, and it is confirmed that there is a standard synthesis formula {765,642,643, <763> ,N,newly created} and 1 corresponding proof relationship (459,765).

[0267] 68) Since the standardized synthesis formula 765 in step 67) above is marked as a newly created state, the execution of the transaction unit is triggered and the state is immediately lost after the transaction unit is executed: 765 is found to match the hypothesis synthesis formula 660, that is, the reasoning target proposed by the user. Therefore, the knowledge base device reports the synthesis formula with the substance code 765 as the reasoning result. Since the syntactic substance code of 765 is 642, the concept sequence is <763> The equivalent syntactic form of 642 is 443, and its reference sequence is <233,234>, which can be converted into a text block sequence <"population", "need to submit a new inspection application to the school hospital"> through the LOCF table and SYMX table, and the concept sequence <763> The ordinal position in the text block "crowd" corresponds to the position of "people." On the other hand, the symbol sequence used to represent concept 763 is <"Zhang San," "Li Si">. Based on the reference sequence and symbol sequence, the synthesized symbol sequence "Zhang San and Li Si need to submit a new examination application to the school hospital" is reported to the user.< / cpts> < / cpts> < / cpts> < / cpts> < / cpts> < / cpts> < / agcptrs> < / aglocrf> < / indr> < / agcptrs> < / afcptrs> < / scptrs> < / agcptrs> < / afcptrs> < / scptrs> < / agcptrs> < / aglocrf> < / afcptrs> < / aflocrf> < / scptrs> < / slocrf> < / aglocrf> < / aflocrf> < / slocrf> < / slocrf> < / aglocrf> < / aflocrf> < / scptrs> < / agcptrs> < / afcptrs> < / fcptrs> < / fcptrs> < / flocrf> < / flocrf> < / flocrf> < / fcptrs> < / gcptrs> < / fcptrs> < / fcptrs> < / gcptrs> < / gcptrs> < / gcptrs> < / fcptrs> < / glocrf> < / flocrf> < / gcptrs> < / glocrf> < / fcptrs> < / flocrf> < / gcptrs> < / fcptrs> < / glocrf> < / flocrf> < / cpts> < / cpts> < / cptrs> < / cptrs> < / locrf> < / cptrs> < / locrf> < / cpts> < / rlocf> < / rlocf> < / aglocf> < / aflocf> < / slocf> < / rlocf> < / aglocf> < / aflocf> < / slocf> < / rlocf> < / slocf> < / rlocf> < / rlocf> < / locf> < / locf> < / slocf> < / slocf> < / flocf> < / glocf> < / slocf> < / flocf> < / locf> < / glocf> < / locf> < / slocf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / locf> < / bbbf> < / bbbf>

Claims

1. An interactive mind map knowledge base device, characterized in that the knowledge base device is used to store knowledge; it includes a mind map module, which specifically includes the following types of units; 1.

1. Syntactic unit, referred to as syntactic unit; syntactic unit stores the common semantic structure of comprehensive sentences with the same semantic structure; a semantic structure represents a specific relationship between a group of unspecified concepts; a semantic structure has a group of positions for placing concepts; when a concept is placed in a specific position of a semantic structure, the concept is said to appear in the position; 1.

2. Comprehensive unit, referred to as comprehensive; comprehensive stores knowledge described by a comprehensive sentence with authenticity; when a comprehensive stores knowledge described by a comprehensive sentence, the comprehensive stores the semantic structure of the comprehensive sentence, the concepts appearing in the semantic structure at the position where the concepts are placed, and the context of the comprehensive sentence; the comprehensive represents the comprehensive sentence; 1.

3. Syntactic equivalence unit, referred to as syntactic equivalence; syntactic equivalence stores an association between two semantic structures. The meaning of the association is that there is a one-to-one correspondence between the positions where concepts are placed in the two semantic structures. When the concepts appearing in the corresponding positions are the same, the two semantic structures and the concepts appearing in the positions where the concepts are placed express the same semantics as a whole. 1.

4. Substantial Equivalence Unit, referred to as Substantial Equivalence; the knowledge base device uses codes to represent concepts; Substantial Equivalence stores an association between two codes representing concepts, and the meaning of the association is that the two codes represent the same concept; 1.

5. Analogy equivalence unit, referred to as analogy equivalence; the analogy equivalence stores an association between two comprehensive sentences, and the meaning of the association is that the two comprehensive sentences have the same context; when all comprehensive sentences in the use scenario of the knowledge base device have the same context, the knowledge base device chooses not to use the analogy equivalence; at this time, it is equivalent to that all comprehensive sentences represented by all comprehensive formulas in the specified mind map module have the same context, and the comprehensive formula no longer stores the context of the comprehensive sentence.

2. The interactive mind map knowledge base device according to claim 1, characterized in that: The knowledge base device is also used to store thinking methods; The mind map module also includes the following types of optional units as required: 2.

1. Analytical formula unit, referred to as analytical formula; analytical formula alone or in conjunction with the comprehensive and comprehensive mapping formula stores the thinking method illustrated by the specific instance of the analytic sentence with authenticity; when an analytical formula stores a thinking method, the analytical formula stores the application scenario of the thinking method and the process description of obtaining the reasoning result by applying the thinking method; 2.

2. A synthesis-analysis mapping unit, referred to as a synthesis-analysis mapping; a synthesis-analysis mapping stores an association between a synthesis statement and an analysis statement, wherein the association means that the synthesis statement is the context required for the analysis statement to be converted into a specific instance of the analysis statement; 2.

3. Predicate form unit, referred to as predicate form; The predicate type stores the association between a comprehensive sentence and its subject part. When a predicate type stores the association between a comprehensive sentence and its subject part, the predicate type stores: in the comprehensive type representing the comprehensive sentence, the position where the concept corresponding to the subject of the comprehensive sentence appears in the semantic structure.

3. The interactive mind map knowledge base device according to claim 1 or 2, characterized in that: When the knowledge base device creates various units of the mind map module based on the concept sequences represented by natural language sentences, the various units of the mind map module store the knowledge and thinking methods described by the natural language sentences corresponding to these concept sequences in the following manner; 3.

1. The syntactic storage of the common semantic structure of comprehensive sentences with the same semantic structure is implemented as follows: if there is a group of comprehensive sentences, the concept sequences they represent are of the same length, the concepts in the specific order are different, and the concepts in other orders are the same, then they conform to the common semantic structure; the positions that may exist in different concept sequences are called variable positions; these variable positions are named "the first", "the second" ... "the nth" variable positions in the order in which they appear in the concept sequence; this group of variable positions is the position where the concepts are placed in the semantic structure; at this time, the core attributes of the syntactic storage include: A set of variable bits; for this type of unit and other mind map module units, if two mind map module units are said to have a set of variable bits and they correspond to each other, it means that the number of the two sets of variable bits is equal, the names are the same, and there is a corresponding relationship between the variable bits with the same name; 3.

2. When a comprehensive formula stores the knowledge described by a comprehensive sentence, the comprehensive formula stores the semantic structure of the comprehensive sentence, the concepts appearing at the positions where the concepts are placed in the semantic structure, and the context of the comprehensive sentence, which is implemented as follows: a comprehensive formula stores the semantic structure that the concept sequence represented by a comprehensive sentence conforms to, the context of the comprehensive sentence, and the concepts appearing at the variable positions of the concept sequence represented by the comprehensive sentence; in this case, the comprehensive formula is said to have a set of variable positions, which correspond to the variable positions of the syntactic formula storing the semantic structure, and the concepts appearing at the variable positions of the semantic structure are also said to appear at the corresponding variable positions of the comprehensive formula; in this type of unit and other mind map module units, the concepts appearing at a set of variable positions are sorted according to the names of their variable positions, and the resulting sequence is called a variable sequence. In this case, the rank of a concept in the variable sequence is also the name of the variable position where the concept appears, so "the variable position where the concept appears" and "the rank of the concept in the variable sequence" have the same meaning; in this case, the core attributes stored in the comprehensive formula include: A syntactic formula, a context, a set of variable positions, and a variable sequence; the context attribute of the comprehensive formula can be vacant when it is created, and then the context of the comprehensive formula is inferred based on the same relationship of the comprehensive formula context described by the analogy equivalent formula; when implementing this type of unit and other mind map module units, the dependent variable position attribute can be inferred from the variable sequence attribute, that is, the number of variable positions is equal to the length of the variable sequence, and the names are "the first"... "the nth" variable positions, and the variable position attributes are no longer stored separately; 3.

3. The syntactic equivalence expression stores a relationship between two semantic structures. The meaning of the relationship is that there is a one-to-one correspondence between the variable positions in the two semantic structures. When the concepts appearing in the corresponding positions are the same, the two semantic structures and their positions in which the concepts are placed are the same. The concepts that appear in the positions represent the same semantics as a whole, which is realized as follows: if there are two semantic structures, called semantic structure form 1 and semantic structure form 2, there is a one-to-one correspondence between their variable positions; in this case, for any pair of concept sequences, if the first one conforms to semantic structure form 1 and the second one conforms to semantic structure form 2, and the concepts that appear in the corresponding variable positions are the same, then they must represent the same semantics; in this case, semantic structure form 1 and semantic structure form 2 are said to have equivalent meanings; the syntactic forms that store semantic structure form 1 and semantic structure form 2 are called equivalent syntactic form 1 and equivalent syntactic form 2 respectively; At this point, the core properties of syntactically equivalent storage include: There is a one-to-one correspondence between equivalent syntactic form 1, equivalent syntactic form 2, and the variable positions between equivalent syntactic form 1 and equivalent syntactic form 2; there is a syntactic equivalence relationship between equivalent syntactic form 1 and equivalent syntactic form 2; the syntactic equivalence relationship is transitive, and all syntactic forms connected by the syntactic equivalence relationship are called equivalent; to simplify the expression, the same or equivalent syntactic forms are referred to as syntactic equivalence; 3.

4. The said substantial equivalence stores an association between two codes representing concepts. The meaning of said association is that the two codes represent the same concept. It is realized as follows: the knowledge base device uses codes to represent concepts. If two codes represent the same concept, the two codes are called the formal codes of the concept, or formal codes for short. If a concept corresponds to a unique code, the code is called the substantial code of the concept, or substantial code for short. At this time, the core attributes of the substantially equivalent storage include: two formal codes representing the same concept; the two formal codes representing the concepts are said to have a substantially equivalent relationship; the substantially equivalent relationship is transitive, and all formal codes representing the concepts connected by the substantially equivalent relationship are said to be substantially equivalent; 3.

5. The analogy equivalent form stores an association between two comprehensive sentences. The meaning of the association is that the two comprehensive sentences have the same context, which is realized as follows: the two comprehensive sentences with the same context are called equivalent comprehensive sentence 1 and equivalent comprehensive sentence 2, and the comprehensive formulas representing the two comprehensive sentences are called equivalent comprehensive formula 1 and equivalent comprehensive formula 2; therefore, the core attributes of analogy equivalent form storage include: equivalent comprehensive formula 1 and equivalent comprehensive formula 2; equivalent comprehensive formula 1 and equivalent comprehensive formula 2 have an analogy equivalent relationship; the analogy equivalent relationship is transitive, and the contexts of all comprehensive formulas connected by the analogy equivalent relationship are the same; 3.

6. When an analytical formula stores a thinking method, the analytical formula stores the application scenario of the thinking method and the process description of obtaining the reasoning result by applying the thinking method, which is implemented as follows: an application scenario of the thinking method is composed of two comprehensive sentences, wherein the first comprehensive sentence contains all the semantics of the second comprehensive sentence or contains part of the semantics of the second comprehensive sentence; in this case, the first comprehensive sentence is said to contain or partially contain the second comprehensive sentence, and the comprehensive formula representing the first comprehensive sentence is said to contain or partially contain the comprehensive formula representing the second comprehensive sentence; the analytical formula is said to connect the two comprehensive formulas; the first comprehensive formula is called the cause comprehensive formula of the analytical formula; the second comprehensive formula is called the result comprehensive formula of the analytical formula; the process of obtaining the reasoning result by applying the thinking method is divided into two steps; the first step is the screening step , that is, to find knowledge that meets specific conditions in the existing knowledge as the basis for reasoning; the second step is the generation step, that is, based on the knowledge obtained in the screening step or the knowledge that "existing knowledge cannot be found based on specific conditions", the knowledge implied or partially implied is generated; the analysis formula uses two groups of variable bits and the concepts on them to represent the execution methods of the screening step and the generation step respectively; at this time, the analysis formula contains two parts: the screening part and the generation part; the screening part contains a group of variable bits and the concepts on them, which represent the execution method of the screening step; the generation part contains a group of variable bits and the concepts on them, which represent the execution method of the generation step; at this time, the core attributes stored in the analysis formula include: a cause synthesis formula, a result synthesis formula, a group of screening part variable bits, a screening part variable sequence, a group of generation part variable bits, and a generation part variable sequence; 3.

7. The separation-comprehensive mapping type stores an association between a synthesis statement and an analysis statement. The meaning of the association is that the synthesis statement is the context required for the analysis statement to be converted into a specific instance of the analysis statement. It is implemented as follows: based on a concept sequence represented by an analysis statement, it is converted into a concept sequence represented by a specific instance of the analysis statement, that is, the concept at a specific position in the concept sequence represented by the analysis statement is replaced by another concept in its context; when the context can be described by a synthesis statement, the concept in the concept sequence represented by the synthesis statement is the concept source of the aforementioned concept replacement operation; as mentioned above, the separation-comprehensive mapping type stores an association between a synthesis statement and an analysis statement. The meaning of the association is that the synthesis statement is the context required for the analysis statement to be converted into a specific instance of the analysis statement. In the concept sequence represented by the specific instance of the analytical sentence, the concepts related to the application scenario of the thinking method and the process of obtaining the reasoning result are stored by the analysis formula's screening part variable sequence and the generation part variable sequence; therefore, the result of the aforementioned concept replacement operation is that the concepts appearing in the specific analysis formula's screening part and generation part variable positions will be the same as the concepts appearing in the specific comprehensive formula's variable positions; the separation-comprehensive mapping formula describes this concept identity relationship; at this time, the core attributes stored in the separation-comprehensive mapping formula include: an analysis formula, a comprehensive formula, and the corresponding relationship between the variable positions in the analysis formula and the variable positions in the comprehensive formula with the same concept relationship; at this time, the analysis formula and the comprehensive formula are said to have a separation-comprehensive mapping relationship; 3.

8. When a predicate type stores the association between a comprehensive sentence and its subject part, the predicate type stores: in the comprehensive type representing the comprehensive sentence, the position where the concept corresponding to the subject of the comprehensive sentence appears in the semantic structure, which is realized as follows: the comprehensive type representing the comprehensive sentence is called the frame comprehensive type of the predicate type; the variable position where the concept corresponding to the subject of the comprehensive sentence in the frame comprehensive type is located is called the key variable position; at this time, the core attributes of the predicate type storage include: a frame comprehensive type and a set of key variable positions; 3.

9. The process of creating a mind map module unit by the knowledge base device has the following characteristics: the knowledge base device uses a code to represent the identity of the mind map module unit, which is called the identity code of the mind map module unit; the identity code of a mind map module unit is used to refer to the unit in the attributes stored in other mind map module units; the attributes stored in the mind map module unit are unique, that is, the identity code of the mind map module unit corresponds to the attribute one by one; similar to the code representing the concept, the identity code of the mind map module unit is also divided into a formal code and a substantive code; when a mind map module unit stores its attributes, only the substantive code representing the identity of the mind map module unit and the substantive code representing the identity of the mind map module unit are used. When a mind map module unit uses a formal code representing the identity of a mind map module unit or a formal code representing a concept when storing its attributes, the identity code of this mind map module unit is a formal code; a mind map module unit whose identity code is a formal code corresponds to only one mind map module unit whose identity code is a substantial code; multiple mind map module units whose identity codes are formal codes may correspond to the same mind map module unit whose identity code is a substantial code; in the above-mentioned many-to-one relationship, a mind map module unit whose identity code is a formal code is called a formal unit of a mind map module unit whose identity code is a substantial code; conversely, a mind map module unit whose identity code is a substantial code is a mind map module unit whose identity code is a formal code. The substantive unit of the unit; the context attribute of the comprehensive formula stores a code representing the context concept; one comprehensive formula corresponds to a specific context, and multiple comprehensive formulas may correspond to the same context. Therefore, the identity code of the comprehensive formula, including the formal code and the substantive code, are all formal codes of the context concept; therefore, the analogy equivalence formula also illustrates the substantive equivalence relationship between the formal codes representing the context concept; based on the substantive equivalence relationship between the concept codes and the equivalence relationship between the syntactic formulas, firstly establish a many-to-one relationship between the formal unit and the substantive unit of the mind map module unit whose attributes only contain concepts and syntactic formulas, and then, based on the established many-to-one relationship between the formal unit and the substantive unit, successively convert the mind map module unit attributes using the formal code into those saved only using the substantive code, and gradually establish the substantive units of all mind map module units.

4. The interactive mind map knowledge base device according to claim 3 is characterized in that the synthesis formula includes three types, namely, the normative synthesis formula, the provable synthesis formula, and the hypothetical synthesis formula; the normative synthesis formula stores necessary facts; the provable synthesis formula stores possibilities, which represents a set of possible normative synthesis formulas that conform to its meaning; the hypothetical synthesis formula stores thinking goals, which instructs the knowledge base device to perform reasoning calculations to obtain a set of possible normative synthesis formulas that conform to its meaning; the meaning of the normative synthesis formula conforming to the provable synthesis formula or the hypothetical synthesis formula is that they have the same context and equivalent syntax, and the concepts at the corresponding variable positions are the same or the concepts of the provable synthesis formula and the hypothetical synthesis formula are "pending"; the meaning of the corresponding variable positions is: since the variable positions of a syntactic formula correspond to the variable positions of the synthesis formula with the syntactic formula as the attribute, the one-to-one correspondence between the variable positions of the two equivalent syntactic formulas also indicates the one-to-one correspondence between the variable positions of the two synthesis formulas with the two syntactic formulas as the attributes, and the corresponding variable positions refer to the variable positions in the two synthesis formulas that have such a corresponding relationship.

5. The interactive mind map knowledge base device according to claim 4, characterized in that: 5.

1. The analytical formulas described include two types: affirmative analytical formulas and negative analytical formulas; the basis for the one-time application of the thinking method stored in the affirmative analytical formula is a set of standard comprehensive formulas; the basis for the one-time application of the thinking method stored in the negative analytical formula is a negative hypothesis comprehensive formula, which refers to a hypothesis comprehensive formula that has no known standard comprehensive formula that meets its meaning; the variable positions of the screening part of the analytical formula correspond to the variable positions of the cause comprehensive formula connected to it, and the variable positions of the generating part correspond to the variable positions of the result comprehensive formula connected to it; the reasoning result of the analytical formula has a set of variable positions that correspond to the variable positions of the generating part of the analytical formula; The generation part of the analytical formula includes a set of variable positions and concepts on them, which are used to represent the execution method of the generation step, and are implemented as a reasoning method for obtaining the concept on the corresponding variable position in the reasoning result by representing the concept on the variable position of a generation part; the reasoning method includes: known, that is, a specific concept is fixed; reference, that is, the same as the concept on the specific variable position in the standard comprehensive formula or hypothesis comprehensive formula based on the application analytical formula; set, that is, a set of standard comprehensive formulas based on the application analytical formula are clustered according to the concepts on the specific variable positions, and in each category, the concepts on the variable positions based on the specific non-clustering basis are synthesized into a set, and at the same time, the concept on the variable position based on the specific non-clustering basis is confirmed. Recognize that there is a concept used to refer to the set; decomposition, that is, knowing that the concept at a specific variable position in the canonical synthesis or hypothesis synthesis based on which the analytical formula is applied refers to a set, decompose the set into its element concepts; reflection, that is, confirm that there is a concept used to represent the canonical synthesis itself ultimately obtained by reasoning; pending, that is, the fixed "pending" concept is obtained, indicating that the concept at the variable position cannot be obtained by applying the thinking method stored in this analytical formula; at the same time, the analytical formula indicates the relationship between the specific generating part variable position and the screening part variable position, which is called the source relationship of the generating part variable position; if the generating part is a table at the i-th variable position The concept of "collection", "decomposition" or "reference" method is associated with the j-th variable position of the screening part. The source relationship indicates that the basis for obtaining the concept on the i-th variable position in the reasoning result is: the concept on the variable position corresponding to the j-th variable position of the screening part in the comprehensive formula based on which the thinking method is applied this time; to simplify the expression, the concept that does not represent the reasoning method is directly used in the generation part to represent the "known" reasoning method, that is, the concept is fixed, and the "to be determined" concept is used to represent the "to be determined" reasoning method; the variable position where the concept representing the "known", "reflection" and "to be determined" reasoning methods in the generation part is located has no source relationship; 5.

2. The predicate formula is also used to associate the task execution system or data query system connected to the knowledge base device, and is implemented as follows: when a hypothesis synthesis formula that conforms to the predicate form is created during the reasoning process, the knowledge base device operates the task execution system or data query system to execute the task and confirm that the standard synthesis formula that stores the task execution result exists in the mind map module, or queries data and confirms that the standard synthesis formula that stores the query result exists in the mind map module; the hypothesis synthesis formula conforms to the form of the predicate formula, which means that the following conditions are met at the same time: 1) the context of the hypothesis synthesis formula and the framework synthesis formula of the predicate formula are the same and the syntax is equivalent; 2) the concept at the key variable position in the framework synthesis formula is the same as the concept at the corresponding variable position in the hypothesis synthesis formula or the concept in the framework synthesis formula is "pending"; 3) the concept at the variable position corresponding to the key variable position of the framework synthesis formula in the hypothesis synthesis formula is not "pending"; at this time, the concept at the variable position corresponding to the key variable position of the framework synthesis formula in the hypothesis synthesis formula constitutes the parameter of task execution or the condition of data query; 5.

3. In the above-mentioned separation-comprehensive correspondence relationship, if the synthesis formula is a provable synthesis formula, it means that there is a separation-comprehensive correspondence relationship between the analytical formula and each canonical synthesis formula represented by the provable synthesis formula.

6. The interactive mind map knowledge base device according to claim 5 is characterized in that the knowledge base device can also be used for reasoning calculation; the knowledge base device also includes a reasoning calculation module; the reasoning calculation module performs reasoning calculation based on the units of the mind map module, and creates or deletes the mind map module units in the following way to record the process or result of the reasoning calculation; 6.

1. The mind map module also includes a type of unit used in the reasoning process, called the reasoning result unit, referred to as the reasoning result; the second step of the reasoning result obtained by the analytical storage thinking method is the generation step, that is, based on the knowledge obtained in the screening step or the knowledge that "it is impossible to find existing knowledge based on specific conditions", the knowledge contained or partially contained is generated, which is implemented as follows: the reasoning calculation module confirms that the reasoning result of the generated knowledge is already stored in the mind map module, otherwise it creates the reasoning result of the generated knowledge; to simplify the expression, "confirm the existence..." is used to represent "confirm the existence..., otherwise create..."; the reasoning result includes a set of variable positions and a variable sequence composed of the concepts on this set of variable positions sorted by the variable position names; the reasoning result obtained based on an analytical formula has a set of variable positions corresponding to the result synthesis formula connected to the analytical formula; The inference calculation module performs a synthesis process on the inference result to obtain a standard synthesis formula; the syntax and context of the standard synthesis formula obtained by the synthesis process are the same as the result synthesis formula connected with the analysis formula, and its variable positions correspond to the variable positions of the result synthesis formula, and its variable sequence is obtained by the following method: the inference results of the analysis formula connected with the same result synthesis formula are divided into a group; in each group of inference results, all possible combinations are found, so that in each combination, all inference results have and only have one non-"pending" concept on the corresponding variable position, and these non-"pending" concepts are sorted by the variable position name to obtain a variable sequence, and the variable sequence is a variable sequence of a standard synthesis formula obtained by the synthesis process; at this time, the core attributes stored in the inference result include: a grouping mark, a group of variable positions, and a variable sequence; the grouping mark of the inference result obtained by an analysis formula is the result synthesis formula connected with the analysis formula; 6.

2. The process of the reasoning calculation module executing the reasoning calculation is composed of transaction units; the execution of the transaction unit is triggered by the mind map module unit marked with a state; the states include newly created, newly deleted, and to be integrated; the transaction unit is divided into a generation transaction unit and a deletion transaction unit; the generation transaction unit is triggered and executed by the mind map module unit marked with a newly created or to be integrated state; when a specific step of the generation transaction unit requires the deletion of a mind map module unit, it is not directly deleted, but only marked with a new deletion state; in all transaction units, all the operation steps of "the reasoning calculation module finds...mind map module unit" ignore the mind map module unit marked with a new deletion state; when a specific step of a transaction unit confirms the existence of a mind map module unit marked with a new deletion state, its new deletion state is cancelled; when a specific step of a transaction unit creates a new mind map module unit, it is marked with a new creation state; the deletion transaction unit is triggered and executed by the mind map module unit marked with a new deletion state, and the unit is actually deleted in the transaction unit; the mind map module unit marked with a state is triggered after the execution of the corresponding transaction unit The state is lost immediately; for the mind map module units that do not exist in the knowledge base device when the reasoning starts, the reasoning calculation module records the process of their being confirmed by the generated transaction unit; the execution of the generated transaction unit is triggered by a mind map module unit marked with a state, which is called a trigger unit, and it may confirm the existence of multiple mind map module units, each of which is called a confirmation unit; the reasoning calculation module records the process of a generated transaction unit confirming the existence of a group of mind map module units as a group of proof relationships; the proof relationship is a type of mind map module unit that the reasoning calculation module needs to use when performing reasoning calculations, and its stored core attributes include a trigger unit and a confirmation unit; a proof relationship is called supported by its trigger unit and owned by its confirmation unit; for all mind map module units that do not exist at the beginning of the reasoning, after a transaction unit is completed, if they lose all the proof relationships they have, they are marked with a new deletion state; when the reasoning calculation module actually deletes a mind map module unit, all the proof relationships supported by the unit are deleted at the same time; the proof relationship itself is not deleted because it does not have a proof relationship, nor is it marked with a state, and it is deleted immediately when it needs to be deleted; 6.

3. When a hypothesis synthesis is marked with a newly created state, the execution generation transaction unit is triggered: the hypothesis synthesis is denoted as H; first, all the proof relations supported by H are deleted; then, the reasoning calculation module finds all the analytical formulas that may confirm the existence of reasoning results that meet the meaning of H; for each of them, denoted as Ah, the reasoning calculation module reversely obtains a screening condition, denoted as Fa, based on the reasoning method represented by the generating part of Ah, so that the canonical synthesis obtained by the screening of Fa may obtain the reasoning result that meets the meaning of H after applying the thinking method of Ah; if Fa meets the meaning of the screening part of Ah, then it is confirmed that there is a hypothesis synthesis, denoted as Ha, and the context and syntactic form of Ha are consistent with Ah. The cause-synthesis formula is the same as that of the hypothesis, and its variable sequence represents Fa. At the same time, a proof relationship (H, Ha) is created, and it is confirmed that there is an association between Ha and Ah, which is called an evidence-based association. The evidence-based association is a type of mind map module unit that the reasoning calculation module needs to use when performing reasoning calculations. The core attributes stored in it include: a hypothesis synthesis formula and an analysis formula; the evidence-based association Sah describes the evidence-based association between Ha and Ah and creates a proof relationship (H, Sah); then, the reasoning calculation module finds all the sub-synthesis mapping formulas in which Ah participates, and for each of them, it is recorded as Ma. Ma describes the sub-synthesis mapping relationship between the analysis formula Ah and the synthesis formula Ta. If the meaning of Ta does not contradict Fa, then it is confirmed that there is In a hypothesis synthesis formula, denoted as Ht, its context and syntactic formula are the same as Ta, and its variable sequence represents the meaning of Ta restricted by Fa. At the same time, a proof relationship (H, Ht) is created, and it is confirmed that there is an association between Ma, Ht and Ah, which is called a deformation association; the deformation association is also a type of mind map module unit that the reasoning calculation module needs to use when performing reasoning calculations. The core attributes stored in it include: a synthesis-analysis mapping formula, a hypothesis synthesis formula, and an analysis formula; the deformation association Cmha describes the deformation association between Ma, Ht and Ah, and creates a proof relationship (H, Cmha); then, the reasoning calculation module finds all the predicate formulas that match H's meaning, and for each of them, Denoted as Ph, if Ph is associated with the task execution system or data query system connected to the reasoning calculation module, the reasoning calculation module executes the task or queries the data, and confirms that there is a set of standard comprehensive formulas that store the task results or required data. For each of them, denoted as Nh, a proof relationship (H, Nh) is created; the analytical formula may confirm that there is an inference result that conforms to the meaning of the hypothesis comprehensive formula. One judgment method is that the result comprehensive formula connected by the analytical formula is syntactically equivalent to the hypothesis comprehensive formula, the context is the same, and the variable sequence of the analytical formula generation part and the variable sequence of the hypothesis comprehensive formula at the corresponding variable positions meet the following conditions: 1) the concept of the hypothesis comprehensive formula is "pending", or 2) the concept of the hypothesis comprehensive formula is not "pending" and the generated formula is The concept of the part represents a non-"known" reasoning method, or 3) the concept of the hypothesis synthesis is not "to be determined" and is the same as the concept of the generation part; the screening conditions are reversed based on the analytical formula, so that the standard synthesis obtained after screening may obtain the reasoning result that conforms to the meaning of the hypothesis synthesis after applying the thinking method stored in the analytical formula. One implementation is that the screening conditions are recorded as a variable sequence, and its variable positions are recorded to correspond to the variable positions of the screening part of the analytical formula. At this time, since the variable positions of the generation part of the analytical formula are associated with the variable positions of the screening part in the source relationship, the variable positions of the generation part of the analytical formula are also associated with the variable positions of the screening conditions at the same time; the concept on each variable position of the screening condition is determined by the following method: the variable positions of the hypothesis synthesis and the variable positions of the generation part correspond to each other. Should; for each pair of corresponding variable positions, if the concept of the hypothesis synthesis is not "to be determined" and the concept of the generation part represents the "reference" reasoning method, then the concept on the screening condition variable position associated with the generation part variable position is equal to the concept of the hypothesis synthesis, for the screening condition variable position whose concept cannot be determined according to the described method, the concept on it is equal to the non-"to be determined" concept on its corresponding screening part variable position, if the concept on its corresponding screening part variable position is "to be determined", then the concept on it is "arbitrary"; a method for judging whether the screening condition meets the meaning of the analytical screening part is that the concepts of the screening condition variable sequence and the analytical screening part variable sequence at the corresponding variable positions are the same or the concept of the screening part is "arbitrary"; the hypothesis synthesis One implementation of the variable sequence representing the screening condition is that the variable sequence of the hypothesis synthesis formula is obtained by replacing "arbitrary" with "to be determined" in the screening condition variable sequence; a method for judging whether the meaning of the synthesis formula is not inconsistent with the screening condition is that the score-to-synthesis correspondence relationship contains the concept-identical relationship between the i-th variable position of the analysis formula screening part and the j-th variable position of the synthesis formula, and for each group of i and j, it satisfies: 1) the concept on the j-th variable position of the synthesis formula is not "to be determined", and the concept on the i-th variable position of the screening condition is the same as it or "arbitrary", or 2) the concept on the j-th variable position of the synthesis formula is "to be determined"; the variable sequence of the hypothesis synthesis formula represents the synthesis formula having a score-to-synthesis correspondence relationship with the analysis formula after being restricted by the screening condition. The significance obtained, one implementation is to obtain the variable sequence of the hypothesis synthesis formula in the following way: 1) for each set of i and j mentioned above, if the concept on the j-th variable position of the synthesis formula is "to be determined" and the concept on the i-th variable position of the screening condition is "arbitrary", then the concept on the j-th variable position of the hypothesis synthesis formula is "to be determined", 2) at the same time, for each set of i and j mentioned above, if the concept on the j-th variable position of the antipodal synthesis formula is "to be determined" and the concept on the i-th variable position of the screening condition is not "arbitrary", then the concept on the j-th variable position of the hypothesis synthesis formula is the same as the concept on the i-th variable position of the screening condition, 3) the concept on the variable position of the hypothesis synthesis formula that cannot be determined according to the above method is equal to the concept on the corresponding variable position of the antipodal synthesis formula; 6.

4. When an analysis formula is marked with a newly created or newly deleted state, the corresponding transaction unit is triggered to execute, and the following operations are performed in the creation or deletion transaction unit: the analysis formula is A; the reasoning calculation module finds the hypothesis synthesis formulas that may confirm the existence of the reasoning results that meet the meaning of the analysis formula A, and marks the newly created state for these hypothesis synthesis formulas; 6.

5. When an evidence-based association marks a newly created state, the execution generation transaction unit is triggered: the evidence-based association is denoted as S, which describes the evidence-based association between the hypothesis synthesis formula H and the analytical formula A; first, all the proof relationships supported by S are deleted; then, the reasoning calculation module finds the standard synthesis formula that meets the meaning of H, and the set thereof is denoted as E; if A is a positive analytical formula, E is used as the basis for applying the thinking method stored in A; if E is an empty set and A is a negative analytical formula, H is used as the basis for applying the thinking method stored in A; based on the above basis, the reasoning calculation module applies the thinking method stored in A to confirm the existence of each reasoning result; for each reasoning result, denoted as Rs, a proof relationship (S, Rs) is created; 6.

6. When a deformation association marks a newly created state, the execution generation transaction unit is triggered: the deformation association is denoted as C, which describes the deformation association of the sub-synthesis mapping formula M, the hypothesis synthesis formula H and the analysis formula A; first, all the proof relationships supported by C are deleted; then, the standard synthesis formula that conforms to the meaning of H is found, and for each of them, it is denoted as Nt. The reasoning calculation module confirms that there is an analysis formula whose cause synthesis formula and effect synthesis formula are the same as A, and its screening part and generation part variable sequence is the variable sequence obtained after the screening part and generation part variable sequence of A are partially replaced by the concepts in Nt according to the concept identical relationship described by M, and the analysis formula is denoted as At, and the proof relationship (C, At) is created; 6.

7. When a canonical synthesis marks a newly created or newly deleted state, the corresponding transaction unit is triggered to execute, and the following operations are performed in the creation or deletion transaction unit: the canonical synthesis is denoted as N; the reasoning calculation module finds the hypothesis synthesis that conforms to N, and for each of them, denoted as Hn, the reasoning calculation module finds the evidence-based association involved in Hn and marks it as a newly created state; the reasoning calculation module finds the deformation association involved in Hn and marks it as a newly created state; 6.

8. When a reasoning result is marked with a newly created or newly deleted state, the corresponding transaction unit is triggered to execute. The following operations are performed in the creation or deletion transaction unit: the reasoning result is denoted as R, and its grouping is marked as a comprehensive type G; G is marked as a pending comprehensive state; 6.

9. When a synthesis formula is marked with the pending synthesis state, the execution generation transaction unit is triggered: the synthesis formula is denoted as N; first, the proof relationship supported by N is deleted; then, the reasoning calculation module finds all the reasoning results grouped as N and executes the above-mentioned synthesis process on them; the reasoning calculation module confirms that there is a standard synthesis formula obtained by the synthesis process, and for each of them, denoted as Nc, creates a proof relationship (N, Nc).

7. The interactive mind map knowledge base device according to claim 3 is characterized in that the knowledge base device creates various mind map module units based on sequences composed of symbols representing specific concepts to store the knowledge and thinking methods represented by these symbol sequences. The knowledge base device assigns different codes to different sequences, which are called sequence codes; assigns a code that globally distinguishes these positions to each position in each sequence, which is called a position code; uses the sequence code as the identity form code of the mind map module unit and the position code as the form code of the concept; and the knowledge base device records the symbol sequence based on which the mind map module units are created while creating the mind map module units.

8. The interactive mind map knowledge base device according to claim 7, characterized in that the knowledge base device creates various mind map module units based on the natural language text in the form of symbol sequences entered by the user, and responds to the thinking goals specified by the user in the form of natural language text in the form of symbol sequences; 8.

1. The knowledge base device records the symbol sequence based on which the mind map module units are created while creating these units, which is implemented as follows: the knowledge base device also includes an auxiliary module to store natural language text in the form of symbol sequence entered by the user; a text block representing a specific concept in the natural language text is a symbol; a natural language sentence is a sequence composed of symbols, and the symbol sequence corresponds to a concept sequence obtained by arranging the concepts represented by each symbol in the sequence in the order of their symbols; the natural language text is organized in articles, and the articles include an original symbol sequence, referred to as the original sequence, and a group of interpretation symbol sequences, referred to as the interpretation sequence; the original sequence refers to the text used for communication through natural language; the interpretation sequence refers to the text representation of the semantic structure, knowledge and thinking method that needs to be known in advance in order to understand the meaning expressed by the text; the interpretation sequence includes syntactic sequence, comprehensive sequence, and analytical sequence, which illustrate The semantic structure, knowledge and thinking method of the original text are stored in the syntactic, comprehensive and analytical forms of the mind map module respectively; at the same time, the specific subsequences of the original text sequence also constitute sentences that explain the semantic structure, knowledge and thinking method, and the contents described by these subsequences of the original text sequence are also stored in the syntactic, comprehensive and analytical forms; as mentioned above, the knowledge base device assigns a sequence code to each sequence and a position code to each position of each sequence; the knowledge base device creates a mind map module unit based on these codes; at the same time, the knowledge base device uses a type of symbol unit in its auxiliary module to store text block symbols, a type of position unit to store the association between a position code and the symbol appearing at the position it represents, and a type of article unit to record the position code arrangement corresponding to the original text sequence of the article; at the same time, the knowledge base device supplements the position code arrangement corresponding to the symbol sequence based on which the unit is created in its mind map module unit; 8.

2. The knowledge base device responds to the thinking goal provided by the user in the form of natural language text in the form of a symbol sequence, which is implemented as follows: when reporting a comprehensive formula, the knowledge base device refers to a symbol sequence, which is called the reference sequence of the comprehensive formula; a reference sequence refers to a symbol sequence in which any variable position of the comprehensive formula can establish a one-to-one correspondence with its variable position, and this type of symbol sequence includes the syntactic sequences or original sequence subsequences corresponding to all equivalent syntactic forms of the syntactic forms of the comprehensive formula; the knowledge base device keeps the symbols in the reference sequence that do not correspond to the variable positions of the comprehensive formula unchanged, and replaces the symbols corresponding to the variable positions of the comprehensive formula with any symbol that can represent the concept on the variable position.

9. The interactive mind map knowledge base device according to claim 6 or 8, characterized in that: The knowledge base device uses the following types of codes: using a formal code of a type of mind map module unit to indicate that a group of such units are included in the mind map module, and the attributes of this group of such units use formal codes, so the identity code of this group of such units is also a formal code; using a substantial code of a type of mind map module unit to indicate that a group of such units are included in the mind map module, and the attributes of this group of such units only use substantial codes, so the identity code of this group of such units is also a substantial code; the knowledge base device uses the following types of codes and corresponding types of units; locf: global position code / concept form code; if a symbol at a specific position in a sequence of symbols that can be accurately understood refers to a concept, it must refer to a unique concept; symbols at different sequence positions may refer to the same concept; therefore, the global position code is also a formal code for the concept; stxf: code of a syntactic sequence or a subsequence of a textual sequence that describes a semantic structure / formal code of a syntactic formula; a syntactic sequence or a subsequence of a textual sequence that describes a semantic structure corresponds to a unique syntactic formula; different syntactic sequences or subsequences of textual sequences that describe a semantic structure may correspond to the same syntactic formula; therefore, the code of a syntactic sequence or a subsequence of a textual sequence that describes a semantic structure is also a formal code of a syntactic formula; synf: code for the subsequence of the original text sequence or the knowledge explanation / comprehensive form code / grouping mark substantive code; A comprehensive sequence or a subsequence of the original text sequence of the explanatory knowledge corresponds to a unique comprehensive formula; different comprehensive sequences or subsequences of the original text sequence of the explanatory knowledge may correspond to the same comprehensive formula; Therefore, the code for the comprehensive sequence or the subsequence of the original text sequence that describes the knowledge is also a comprehensive formal code; anaf: code of the subsequence of the original text sequence of the analysis sequence or the explanation of the thinking method / analytic formula form code; one subsequence of the original text sequence of the analysis sequence or the explanation of the thinking method corresponds to a unique analytical formula; different subsequences of the original text sequence of the analysis sequence or the explanation of the thinking method may correspond to the same analytical formula; therefore, the code of the subsequence of the original text sequence of the analysis sequence or the explanation of the thinking method is also the formal code of the analytical formula; prdf: predicate-style formal code; stxef: formal code for syntactic equivalence; synef: formal code for analogy equivalent; cptef: the formal code of substantial equivalence; asef: the format code of the comprehensive mapping type; stxs: the substance code of the syntactic formula; ctxs: the substantive code of the context; cpts: the substantive code of the concept; syns: comprehensive substantive code; anas: analytical substantive code; prds: predicate-like substantial code; ases: the content code of the comprehensive mapping type; seks: substantive code for evidence-based associations; tfms: the substance code of deformation association; ress: the substantive code of the inference result.

10. The interactive mind map knowledge base device according to claim 9, characterized in that: The workflow of the knowledge base device is as follows: 10.

1. Acquire and store knowledge, thinking methods, and thinking goals; the mind map module of the knowledge base device receives the natural language text in the form of a symbol sequence entered by the user, assigns a sequence code and a position code to each symbol sequence and each position therein, and The sequence code is the form code of the mind map module unit, and the position code is the form code of the concept; based on these form codes, the mind map module unit is created, the mind map module unit is the form unit, and its identity code is the shape code; 10.

2. Start reasoning calculation; the reasoning calculation module of the knowledge base device starts reasoning calculation according to the user's instructions, first completing the preparation work of reasoning calculation, that is, obtaining the substantial units of all mind map module units, the method is as follows; First, based on the essential equivalence formula, for all formal codes representing concepts with essential equivalence, create the essential codes of the concepts they represent, and record the formal code-essential code comparison relationship of the codes representing the concepts; the formal code-essential code comparison relationship of the codes representing the concepts is called the concept comparison relationship; Then, based on the analogy equivalence, a common context substantive code is created for all the comprehensive form codes with analogy equivalence, and the comparison relationship between the comprehensive form code and the context substantive code is recorded; the comparison relationship between the comprehensive form code and the context substantive code is called the comprehensive context comparison relationship; Then, based on the syntactic equivalence, the order of the variable positions of the syntactic expressions with the syntactic equivalence relationship is unified, and the comparison relationship of the variable position order before and after the unification is recorded, a syntactic substantive code is created for the formal codes of all syntactic expressions with the syntactic equivalence relationship, and the substantive code is used to represent the unified variable position order, and a syntactic substantive unit is created; the formal code-substantive code comparison relationship of the syntactic expression and the variable position correspondence relationship between the syntactic formal unit and the substantive unit are recorded; the formal code-substantive code comparison relationship of the syntactic expression and the variable position correspondence relationship between the syntactic formal unit and the substantive unit of the syntactic expression are called the syntactic comparison relationship; Then, based on the aforementioned concept comparison relationship, syntactic comparison relationship, and comprehensive context comparison relationship, the comprehensive attributes represented by the formal code are converted into attributes represented by the substantial code, and a comprehensive substantial code is assigned to each different attribute to create a comprehensive substantial unit; Recording the comprehensive form code-substance code comparison relationship; the comprehensive form code-substance code comparison relationship is referred to as the comprehensive comparison relationship; Then, based on the aforementioned conceptual comparison relationship, comprehensive comparison relationship, and syntactic comparison relationship, the attributes of the analysis formula represented by the formal code are converted into attributes represented by the substantial code, and an analysis formula substantial code is assigned to each different attribute to create an analysis formula substantial unit; the analysis formula formal code-substance code comparison relationship is recorded; the analysis formula formal code-substance code comparison relationship is referred to as the analysis formula comparison relationship; Then, based on the aforementioned comprehensive contrast relationship, syntactic contrast relationship, and analytical contrast relationship, the attributes of the comprehensive mapping formula represented by the formal code are converted into attributes represented by the substantial code, a comprehensive mapping formula substantial code is assigned to each different attribute, and a comprehensive mapping formula substantial unit is created; the formal code-substantial code contrast relationship of the comprehensive mapping formula is recorded; Then, based on the aforementioned comprehensive comparison relationship and syntactic comparison relationship, the attributes of the predicate type represented by the formal code are converted into attributes represented by the substantial code, a predicate type substantial code is assigned to each different attribute, and a predicate type substantial unit is created; the formal code-substance code comparison relationship of the predicate type is recorded; 10.

3. The reasoning calculation module performs reasoning calculation according to the aforementioned steps based on the substantial units in the mind map module; at the beginning of reasoning, the substantial units corresponding to the formal units of the hypothesis synthesis entered by the user are marked as newly created; during the reasoning process, when a standard synthesis that conforms to the meaning of the hypothesis synthesis entered by the user is created, found or deleted, the reasoning calculation module immediately reports to the user: the reasoning calculation module follows the aforementioned steps, based on the correspondence between the formal units and the substantial units of the mind map module units, to find available reference sequences and symbols that can represent specific concepts, and assembles a natural language text in the form of a symbol sequence to report to the user.

Images