JPH06332705A - Inference device - Google Patents

Abstract

PURPOSE:To attain the high speed of an inference executing speed, and to attain a real time processing by an interruption processing by converting a knowledge base means into a knowledge base table expressed so as to be suitable to a prescribed compiler language. CONSTITUTION:A rule constituting a knowledge base 2 is converted by a translator 3, and stored as a variable expressed with a structure in the compiler language of, for example, C language or the like. A character string used in the rule is converted into a numeric value by a corresponding table by the translator 3. Thus, the operation of the character string in the converted rule can be excluded, and the high speed of inference can be attained. That is, the rule expressed with the character string or a function is defined as the variable having one address, and an ignition processing is executed by the address collation of the variable, so that the high speed of a comparison arithmetic processing can be attained. Moreover, the system call of an OS can be utilized in the converted rule, and time real time processing by the interruption processing or the like can be attained.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an inference device in an expert system or the like for supporting the operation, schedule setting, and planning of aircrafts, physical distribution systems and the like.

[0002]

2. Description of the Related Art Conventionally, an inference apparatus has been proposed which comprises a knowledge base consisting of a plurality of events and a plurality of rules representing causal relationships between the events and an inference section (Japanese Patent Laid-Open No. 64-64-).
1035, JP-A-1-162936).

FIG. 7 is a block diagram showing an example of a conventional inference apparatus. This inference apparatus 50 has a knowledge base 51 containing expert knowledge, an inference unit 52 that executes inference and problem solving based on the knowledge, and a data input / output unit when executing inference and problem solving. Of the working memory 53, and an editor 54 for a specialist to edit the knowledge base 51, an interface 55 and a man-machine section for the user to execute the inference processing in an interactive form, for example. 56 is provided. In the inference, the inference unit 52 makes a matching decision between the knowledge base 51 and the working memory 53, and further controls the competition process and the ignition process.

[0004]

In the conventional inference apparatus 50, since the expression form of the knowledge base 51 is limited to the expression form to be executed by the inference unit 52, revision or extension of the expression form of the knowledge base 51. There is a problem that is difficult. Furthermore, when performing inference, the conflicting process for preventing multiple rules from firing at the same time and the firing process for executing the rules are limited to selection within the range of the specifications of the inference unit 52 set in advance. , Inference device architecture and basic OS
There is a problem that it is difficult to effectively use (operation system).

In order to solve the above-mentioned problems, an object of the present invention is to provide an inference apparatus capable of speeding up inference execution speed and performing various inferences such as real-time processing by interrupt processing and hypothesis inference. It is to be.

[0006]

According to the present invention, there is provided an inference device comprising a knowledge base means composed of a plurality of events and a plurality of rules representing causal relationships between the events, and a working memory. An inference apparatus comprising knowledge base conversion means for converting into a knowledge base table expressed so as to be compatible with a predetermined compiler language.

The present invention is also characterized in that the knowledge base table comprises a condition part table and an execution part table.

Further, the present invention is characterized in that the knowledge base table converted by the knowledge base conversion means makes a matching judgment.

The present invention is also characterized in that the knowledge base means can be described according to a compiler language.

[0010]

According to the present invention, the knowledge base means is represented by the knowledge base conversion means for converting the knowledge base means into the knowledge base table expressed so as to be compatible with the predetermined compiler language. Since each rule is expressed as it is in the execution type, the knowledge base after conversion can perform matching judgment. Since the translator is designed so that the conditional part and the execution part of the rule can be freely described in the compiler language, it is possible to perform interrupt processing and the like utilizing the architecture of the computer that makes inference. Further, since the converted knowledge base table is composed of the condition part table and the execution part table, it is possible to smoothly execute the conflict process and the ignition process in the inference execution.

[0011]

DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 shows an inference apparatus 1 which is an embodiment of the present invention.
It is a block diagram showing. This inference apparatus 1 includes a knowledge base 2 containing expert knowledge, a working memory 5 for loading and unloading data, and an IF group table 4 expressed so as to adapt the knowledge base 2 to a predetermined compiler language. It is composed of a translator 3 for converting, and an editor 6 for an expert to edit the knowledge base 2 and an interface 9 for a user to execute an inference process in an interactive form, and the like. A man-machine section 8 is provided. The IF group table 4 operates the working memory 5 and controls the interface 7.

FIG. 2 is a block diagram showing the internal structure of the IF group table 4 shown in FIG. This IF group table 4
Is an area for storing information on the condition part of the rule (corresponding to the part α in the case of the expression form of IF α THEN β), and the IF execution table (IF α THEN In the case of the expression form of β, it corresponds to a portion of β) and a THEN section collating IF group table 4b which is an area for storing information. The IF group matching IF group table 4a includes a rule condition part area in which a condition part of each rule is stored in a series of address spaces. A duplicate collation prevention unit including various flags, such as a CF value operation for appropriately correcting the CF value (certainty) digitized for each rule, is provided. On the other hand, the THEN section matching IF group table 4b includes a rule execution section area in which execution sections for each rule are stored in a series of address spaces. These have a collation attribute for instructing a rule to be fired, and the IF unit collation IF group table 4a.
Then, the collation attribute operation is performed by looking at the contents of the working memory 5, and the THEN section collation IF group table 4b is executed.
Then, the execution unit of the rule selected by the matching attribute is executed to operate the working memory 5. Inference of each rule can be executed in this way.

FIG. 3 is a flow chart for explaining the operation of the inference apparatus 1 of FIG. First, starting from step a1, in step a2, the knowledge base 2 stored in a floppy disk, disk memory or the like is taken in, and then the translator 3 updates the IF group table 4.

FIG. 4 shows an example of the rules forming the knowledge base 2. In this rule, the content of the field "Field1" of the element "Element1" is "active" and the field "Field4" of the element "Element5" is
If the content of [0] "is less than" 500 "and the content of the variable" Value2 "is" 5 "or more, or if the return value of the function" Func1 () "is" 100 ", Change the content of the field "Fieldl" of the element "Element1" to "inactive". " In addition, in the RHS (Right Hand Side) part of the rule, the above "modify
Displayed on the display as a grammar other than () "writ
It is possible to use e () "and" read () "input from the keyboard.

The rules expressed as described above are converted by the translator 3 and stored as variables expressed by, for example, a structure in the C language compiler language, and each rule is separated into a condition part and an execution part. Are stored in different memory areas.

Variables using elements and fields, arrays, character strings, functions, and the like can be used in rules to provide a highly flexible description. The character string used in the rule is converted into a numerical value by the conversion table shown in FIG. This eliminates character string manipulation in the converted rules, and speeds up inference.

FIG. 6 shows an access method for each element of the rule shown in FIG. When accessing the contents of each variable or the return value of a function, the data storage area (working memory) previously arranged in the memory is indirectly accessed.

That is, the rule expressed by a character string or a function is regarded as a variable having one address, and the firing process is executed by using the address collation of the variable, thereby speeding up the comparison calculation process. You can Further, since the computer architecture can be positively utilized in the converted rule, that is, the system call of the operation system can be freely utilized, real-time processing becomes possible by interrupt processing or the like.

Thus, the knowledge base 2 is the IF group table 4
Then, in step a3 of FIG. 3, the contents of the working memory 5 are updated by executing the external interface or the THEN section collating IF group table 4b. Next, in step a4, the collation attribute in the IF group collating IF group table 4a is manipulated, and then step a5
After performing the duplicate collation prevention operation on the IF group collating IF group table 4a in step 1, and then performing the collation attribute check to determine the THEN section to be executed in the THEN section collating IF group table 4b in step a6. In step a7, the THEN unit is executed, and it is determined whether or not the external interface 7 and the working memory 5 are to be operated. If the working memory 5 is to be operated, the process proceeds to step a2. on the other hand,
When operating the external interface 7, the external interface 7 is accessed. If neither operation is performed, the process proceeds to step a8 to end the inference execution.

[0020]

As described in detail above, according to the present invention, the speed of inference execution can be increased, and the interrupt processing and the like can be performed concurrently with the inference processing, so that the real-time processing is possible. .

[Brief description of drawings]

FIG. 1 is a block diagram showing an inference apparatus 1 which is an embodiment of the present invention.

FIG. 2 is a block diagram showing an internal configuration of an IF group table 4 shown in FIG.

FIG. 3 is a flowchart showing the operation of the inference apparatus 1 of FIG.

FIG. 4 is an example of rules that make up the knowledge base 2;

FIG. 5 is an example of a character string conversion table.

6 is an example of an access method for each element of the rule shown in FIG.

FIG. 7 is a block diagram showing an example of a conventional inference apparatus.

[Explanation of symbols]

 1 inference device 2 knowledge base 3 translator 4 IF group table 4a IF section collating IF group table 4b THEN section collating IF group table 5 working memory 6 editor 7 interface 8 man-machine section

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Kimiyo Nishino 1-1 Kawasaki-cho, Akashi-shi, Hyogo Kawasaki Heavy Industries Ltd. Akashi Plant (72) Masato Hayashi 1-1 Kawasaki-cho, Akashi-shi, Hyogo Kawasaki Heavy industry Co., Ltd. Akashi factory (72) Inventor Yoshinobu Mori 1-1 Kawasaki-cho, Akashi-shi, Hyogo Kawasaki Heavy Industry Co., Ltd. Akashi factory (72) Inoue Motohiro 1-1 Kawasaki-machi, Akashi-shi, Hyogo Kawasaki Heavy Industries Ltd. Company Akashi factory

Claims (4)

[Claims] 1. An inference device comprising a knowledge base means comprising a plurality of events and a plurality of rules representing causal relationships between the events and a working memory, wherein the knowledge base means is adapted to a predetermined compiler language. An inference apparatus comprising a knowledge base conversion means for converting into a knowledge base table expressed as follows. 2. The inference apparatus according to claim 1, wherein the knowledge base table includes a condition part table and an execution part table. 3. The inference apparatus according to claim 1, wherein the knowledge base table converted by the knowledge base conversion unit performs matching determination. 4. The inference apparatus according to claim 1, wherein the knowledge base unit can be described according to a compiler language.