JPS6345631A - Apparatus and method for expert system - Google Patents

Abstract

(57) [Abstract] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention]

BACKGROUND OF THE INVENTION Industrial Field of Application The present invention relates to an extract heart system realized by a digital computer, particularly a knowledge base and an inference engine component of an expert system, an apparatus for creating an expert system, and a defined knowledge base. The present invention relates to an apparatus and a method for producing the same. Recently, expert systems have become commercially available. An expert system is a system that provides information in a predetermined specialized field in the same manner as an expert in the relevant technical field. Furthermore, the Ex-Heart system resembles a human expert (Ex-Heart) in that it can explain itself to some extent. Depending on the complexity, the expert system can explain why a given conclusion was reached, why a given piece of information is needed, and allow the user to change the value of a given piece of information and see how to act on the result. Do it. Configuring large computer systems, diagnosing bacterial infections,
Alternatively, an expert system has already been constructed that diagnoses the reason why the tip of an oil well drilling machine has hit a hole and teaches countermeasures. Prior art expert systems have generally been rule-based, i.e., have functioned by applying rules obtained by asking experts about their area of expertise to facts raised by the user of the expert system. . The rule is generally of the form IF A then B. In such a rule, A is called a predicate of B, which is the conclusion. If A is correct, then the conclusion is considered correct. For example, one rule in a medical diagnostic system is, ``If a patient has a fever and a runny nose, he probably has the flu.'' According to this rule, if the symptoms are a fever and a runny nose, the possible answer is influenza. Figure 1 is a block diagram of a rule-based expert system according to the prior art.Expert system 1
01 has three types of configurations (components). That is, a command processor (CP) 103, a rule inference mechanism (RIE) 105, and a rule storage device (RE) 107. RS 107 includes rules 109 for areas in which the system is Ex-Heart. RIE105 receives all the data in question from the user, and applies R31 to the data.
All rules of 07 are applied, and the results of applying the rules to the mesotopic data are provided to the user. Cr2O2 is controlled by the inference mechanism command CIEC). CP 103 generates commands from command input provided by the user. Regarding the aforementioned influenza, the user of the medical diagnosis expert system is C.
Input the command "What disease?" to P. CP 103 then provides engine instructions to RIE 105 to detect if the rules for the disease require symptoms. RIE 105 then requests the data in question from the user, perhaps by asking, "What are the symptoms?" Next, the user inputs the symptoms and RIE10
5 finds a rule for which the sign is a predicate,
Returns the conclusion of the rule as result data. For example, if the input symptoms are "fever and runny nose," the expert system 101 concludes from the O-rule 109 that the illness is probably influenza. Of course, many other diseases have the same symptoms, so there will be more than one rule 109 that has the symptoms as part of its predicate. Due to its subtlety, the expert system 101
All rules with all their manifestations as part of 109
Either simply return the result as a result, or ask the user for more indications, and use the new indications to narrow down the number of rules to apply. In any case,
According to the user's request, the expert system 101
Indicate which rules 109 were already used to reach the conclusion. The first prior art expert system 101 was custom built and required long-term, close cooperation between experts, knowledge engineers, and computer system engineers. Experts provide their expertise, knowledge engineers apply their expertise to rule 109, and R7'A'105 and R8107.
The display used to memorize the rule 109 was constructed. Finally, I wrote a program to implement the design of a computer system for IT 8 College Engineers. The large amount of input required by experts to configure a specially manufactured expert system 101' makes the system extremely expensive, and the manufacturer of the expert system 101 has developed a special method called an expert system shell for creating an expert system. We decided to develop a new tool. FIG. 1A is a block diagram of an expert system shell 110 in a rule-based expert. 1st A
As you can see, the expert system shell is the
Elements of the rule-based expert system shown in the figure as well as additional elements, namely the rule processor (RP)
' to have. The rule processor 111 specifies a specific R8107 for the currently configured expert system.
It is used to create rules 109 to be stored in the . RIE 105 uses expert system shell 11 to test the expert system as it is configured.
Used in 0. Once all the rules 109 for the Ex-Heart system being developed have been written and the expert system has been fully discovered, users of the new expert system will have access to RIE 105 and R8107 for the new expert. . The usefulness of the expert system shell 110 is
It depends on the subtlety of RPll. Some expert systems require RP111 Near and cannot be used with Exheart itself. In other systems, RPII constructs rules from examples provided by Exhart, and therefore does not require a knowledge engineer. Although rule-based expert systems 101 are steadily becoming more powerful, more used, and less expensive, their dependence on rules has certain inherent drawbacks. First, most experts don't think about their area of expertise in terms of a set of rules. As mentioned above, since the expert does not think, the knowledge engineer or the system composing the rules from the examples must do the thinking between the expert and the expert system shell 110. First, developing an expert system is more expensive than not developing one, and second, the complexity of expert system 110 is even more complex than developing one, and the expert does not have to write rules for shell 110. Since it is necessary to investigate, it does not mean that you are completely free from the rules. Next, R8107 is a rule 1 created independently of each other.
09, there is no guarantee that the collection of rules 109 is complete and does not contain contradictory rules. If the set of rules 109 is incomplete, the expert system 101 may reach no conclusion or may reach an incorrect conclusion. If the set of rules 109 contains contradictory rules 109, then the expert system 101 will either not reach a conclusion again, or the expert system 101 will use RI to resolve all the contradictions rather than the rules.
It is possible to arrive at a conclusion that depends on the internal algorithms of the E105. The ability to operate on incomplete sets of rules 109, or even on contradictory rules 109, is part of the strength of rule-based systems 101, allowing experts to apply their expertise to clear principles. It is needed in situations where you cannot perform. However, expert systems are employed in many situations where experts can apply their expertise to obvious principles, and in these situations,
Incomplete set of rules 109 and contradictory rules 109
The ability to deal with this makes it even more difficult to detect mistakes, and if a mistake occurs, the system 101 operates according to all rules.
<Make it dependent on the internal algorithm of RIE105. Third, it is difficult to modify the Ex-Heart System 101 based on the rules. Based on the rules, the operation of the Extract Heart system depends on the integrity of the rules, and it
g) Determine which rules need to be changed if the operation of the expert system is to be changed because the expert has changed his or her mind about how to handle a given case. is often difficult. Fourth, the power and complexity of rule-based expert systems 101 are not needed in many situations where expert systems are useful. -Intensity and complexity within the shell are required when experts cannot fully specify their expertise. However, there are many situations in which a layperson can completely guide an expert, but the expert's expertise can be fully and easily identified. Under these circumstances, useful expert systems and ex-hard system shells do not require the complexity inherent in rule-based ex-hard systems and expert system shells. One such situation is posed by complex forms, such as tax forms. In most cases, filling out the form requires little judgment, but despite its simplicity, the form is rich and many people require the help of a tax accountant. The spread sheet makes it easier to mechanically handle the data for filling out the tax form and to see how changing one value affects other values, but an expert system can handle all possible types of data. Failure to provide reasonable guidance to all users. therefore,
What is needed and what the invention described herein provides is an expert system that is easier to use than typical rule-based systems, and significantly more efficient than rule-based extract heart systems. The present invention relates to a digital data processing system, and more particularly, to a digital data processing system. The expert system and expert system shell used in the processing system [,
l). The expert system of the present invention is
Definition (dafiniti-03) 'z is used instead of file. An expert defines his area of expertise as a set of terms using a corresponding set of hierarchical definitions. Definitions for a term include lower-level hierarchies, literal rings, constant values, and sources external to the extract heart system (
solLrce>. The decisions that Exhart reaches regarding terms in the hierarchy are expressed as the values of the terms. The defined terms constitute the knowledge base of the expert system of the present invention. The reasoning mechanism is
What decision the expert has made for a given term is detected by calculating the value of the term from the definition. If the definition contains other terms, the values of these terms are computed from those definitions, and if the definitions of other terms contain values obtained from external sources, these values are calculated from the values in the given order. Obtained according to calculation needs. If the external source is a terminal, the expert system asks the person at the terminal for the value, and the person entering the value asks why the value is needed. The reasoner detects from the definition the reason why the value is needed and provides that information to the person entering said value. Once the reasoning mechanism detects what decision the expert made, the user of the expert system asks the expert system how it reached its conclusion. Again, the reasoning mechanism interrogates the hierarchical definition of the term and works through the definition to show how it reached its conclusion. Additionally, the user may request the expert system to infer a different value for one of the terms used to define the term the user originally queried. The reasoner then replaces the new (!f with the old value) and determines the new conclusion for the term originally queried, so that a change in value in one of the dependent terms changes the value of the term originally queried. Show how it was affected.Why the expert system requested all the given inputs.
All of the techniques used in the expert system of the present invention to detect how the expert system reaches a conclusion, change the values of terms, and view the results are useful not only in the expert system of the present invention. , is also applicable to other systems that employ hierarchically defined sets of terms. Is the extract heart system of the present invention an expert shell of the present invention? Created using The extracted heart shell includes an inference mechanism, all the knowledge bases to be defined as described above, and further includes a definition processor that creates definitions in the knowledge base to be defined. In this case, the user of the shell (who is an expert in the shell) enters the definition command for the term he wishes to define.The definition processor then requests an explanation of the term!7.
The expert will explain the section. The foregoing description fully indicates how the value of the term is obtained, and may include a description of where other terms, constants, or extrinsic values are to be obtained. If the description does not contain any terms that are no longer defined, the definition processor defines terms from the description. If the description contains further undefined terms, the definition processor requests a description for each of the undefined terms and processes the aforementioned descriptions. The iterations continue until no undefined terms remain. As a term is defined, the term and its definition become part of the defining knowledge base. The definition processor also allows the expert to redefine terms, remove terms and their definitions from the knowledge base, and view definitions for terms that are to be defined. As can be seen from the above explanation, all information can be provided in the form of definitions rather than extract heart shell ζ and extract heart shell rules of the present invention,
It ensures that a set of definitions is consistent and makes it easy to detect which terms a given term depends on. The techniques employed in the definition processor of the present invention to create intra-hierarchical definitions can be employed not only in the expert system shell of the present invention, but also in any system that creates a hierarchical system of definitions. Thus, it is an object of the present invention to provide an improved overall expert system and extract heart system shell. Another object of the present invention is a defined knowledge base and a defined knowledge base? The object of the present invention is to provide a complete expert system having a reasoning mechanism that can be used to arrive at a conclusion. Yet another object of the present invention is to provide an expert system shell for creating an extracted heart system with a defined knowledge base. It is a further object of the present invention to provide an apparatus and method for creating set terms having hierarchical definitions. Still another object of the present invention is to provide an apparatus and method for creating set terms with hierarchical definitions. provides an apparatus and method for instructing a person how a conclusion was reached, why certain information was requested, and how the conclusion would change if one of the terms received a different value. Still another object of the invention is to provide an apparatus and method that ensures that the knowledge base of an expert system is complete and consistent. Certain improvements in the first and second embodiments of the invention will be understood by those skilled in the art upon reference to the detailed description and drawings. The description will first provide an overview of the Nyor Extract Heart System and Expert System Shell of the present invention, and then provide a detailed description of the first prototype embodiment of the present invention.Certain improvements made in the second prototype embodiment Conceptual overview of expert system shell 201 and expert system 202 according to the present invention (Fig. 2) Fig. 2 is a conceptual block diagram of expert system shell 201 and expert system 202 according to the present invention. The system shell 201 has four elements: instruction processor (CCP) 2031. definition processor CDP) 2
07, term storage device (TS) 215 and term inference mechanism (T
IE') 219 tot[il. Expert system 2 created using expert system shell 201
02 has all 2 of the above elements except DP207. As explained in more detail below, CP2O3 receives commands from users of shell 201 and system 202 and provides them to other elements. DP207 processes the definition and TE
01δ stores defined terms and their definitions. T
IE 219 uses the definition of the term from TE01δ to evaluate the term and perform other operations on the term. CP2O3 & i Ciel 201 and Expert System 2
02 user commands are defined as processor commands (CDPCS) 204 and inference mechanism commands (IEC3
)217. In the prototype embodiment, the DPCS 204 allows a user of the shell 201 to define a term, redefine a term, undefine a defined term, review the definition of a term, or define a set of definitions. allows saving and restoring a set of definitions. lEC
8217 is shell 201. A user of the expert system 202 created by the shell 201 can detect all the current values of a term, find out how the expert system reached that value, To infer the full value of a term, see how it affected the value of a term, reset the value of any or all terms, or find the current value of a term, use an external If you need to supply a definition to a value from Expert System 2, why do you need that value?
Allows you to ask questions to 02. Definition processor 207 defines TERM 206'i. Once T A'A' M 206 is fully defined, T
E01δ is the defined term (D
TERIf) 211 and a definition (DEF) 213 for DTERM 211. TERM206 is DPC
204 or in response to TERM 206, the user of the expert system shell 201 requests D.
It is received from either the description (DESC) 205 to P207. DP207 first checks whether there is already a DTERM211 corresponding to TERM206, that is, TE
Detect whether RM206 has been defined. If so, the DP 207 searches all of the DTF:RM 211 from TE 01 δ corresponding to TERM 206. If it is not defined, the DP 207 outputs a description request CDESCREQ)k to the shell 2010 user. The user writes the description (DESC) 205 of TERM 206 to DP2.
The description then uses the information in DESC 205 to create DK:F 213 for TERM 206. As explained in more detail below, DESC 205 is written in a definition language that allows the user to write other TERMS 2
06, allowing to specify constant values and that certain values are to be obtained from the external expert system 206 that is being defined. The definition is further TER
We define the operations to be performed on the constant and the external value represented by M206. DE:E
If C205 contains TERM;206,
The DP207 is connected to the TERMS206i in exactly the manner described above.
Process. Compatible with TERM”206-f;bDTF:R
If M211 exists, DTERM 211 is used in addition to DEF 213 being configured. If not, DP207 is a DESC that defines TH:Ru2O3.
205 and process as described above. The repeated operations of DP 207 are indicated by arrows 208 in FIG.
UDESC2 containing at least one TERM206
10 is being processed again by DP 207. Original DESC205 as well as original DES
Any DI created for TERMS 206 required to define TERMS 206 in C205,
Processing continues as described above until all TERMS 206 in C3205 have been defined, ie, have corresponding DTERMS 211 and DEFS 213 in T, S'215. DE generated from 7 arithmetic of DTERMS211 and DP207
FS213 is located at 7', S'215. DTERM 211 is located in TE 101 by that name. DEF213+'LDT corresponding to DTERM211
In conjunction with ERM 211 - can be used when HDTERM 211 is located. DEF 213 includes a modified version of DESC 205 from which DEF 213 originated. DPC! ;;The remaining operations defined by 204 are performed in DP 207 and TE 101 as follows. When TERM206 is undefined, DP207 is TS2
The corresponding DTERM 211 and DEF 213 are removed from No. 15. When TERM206 is redefined, DP2
07 removes DEF 213 corresponding to TERM 206 and requests new DE:5C 205 for TERM 206. DESC 205 is then processed as described above. When the DPC requests to display the definition of TERM 206, DP 207 displays the DTERM corresponding to TERM 206.
DE incorporated into DEF213 for 211; C2
05 is displayed. Finally, the specified TE10 is set by the evacuation operation.
The contents of 1 are saved in a file for later use, and restored to the contents of the file fTs 215 by a restoration operation. A term inference mechanism (TIE) 219 performs calculations using DTERM 211 and DEF 213 in T and S' 215. - The next operation is a what'' operation, which detects the first shift of DTERM 211 from the definition and external value provided by the user of expert system 202S or shell 201. TIE 219 responds to lEC 217 by
wha that defines the calculation from P2O3 and TERM206
The TIE: 219 that performs the t operation uses the DTERJl' 211 corresponding to the TERM 206 and the D of the DTERM 211.
Place EF213 at TS215. Then, DTE
Performs the operation specified in DIEF 213 using RMS 211, constant 2, and the external value specified in the definition, and the result is TRES 227t'f-Kispert System 2
02. S Rui returns to the user of the shell 201. The constant in DEF 213 is ready for use in calculating the value of DTERM 211. For external values, DTERM2,1
1 is a description of how an external shift is obtained. TIE219 uses this descriptive sound to request external values (
EXVAL REQ ) to external value (EXVAL) 22
Execute for the source of 5 and EXVAL22 from the source.
Receive 5. In the simplest case, the source is system 202
-! I'm the terminal used by the user of shell 201, and information is obtained by interrogating the user's terminal screen and receiving input. In more complex cases, the source may be a file or a database.
If TERM'11 is being evaluated, TIE 219 acquires DEF 213 of another DTERM 211 and DEF
Calculate the value of DTEEM211 of
In 213, evaluate any DTERM 211 as it is calculated, and in this work its value is added to the what operation.
All DTERMS 211 power from the unique DTERMS 211 that is required will continue at 1. Constants, external values, DT defined by each DEF 213, and ERMS 211i are processed as described above. When all DEF213 are evaluated, the value of DTERM211 for which one box is required is calculated and TREE227
returned as . In the preferred embodiment 2, EXVALS 225 obtained during evaluation of a given DEF 213 becomes part of the definition of that DEF 213. 0, if DTERJyf2
If the what operation is applied twice to 11, then
TIE 219F'l does not generate any EXVALEEQS and simply uses the stored EXVA L 5225 to recalculate the first shift of DTERM 211. The preferred embodiment uses 2 to modify the stored F:XVALS 225.
It has several IE0217. The first or reset removes all stored EXVALS' 225 from nEFS 213 for the DTERM 211 specified in the reset command. When the what operation is performed again in this way, the new E
XVAL225 is obtained as described above. The second, or speculative, allows a new EXVAL 225 to be provided to the DEF 213 for the TERM 206 specified in the speculative command. In this case, when the what operation is performed again, the specified EXV A L225 is used and the wh
The first shift of the DTERM 211 in which the at operation is performed is extracted. Why does the user of the shell 201 or system 202
If it is doubtful that the IE 219 is seeking a predetermined EXVAL 225, it is sufficient to ask gXVAr, REQ k using a command for the "why" operation. In response to that command, TIE 219 sends DE to DTEEM 211, which calculated the value of EXVAL 225 when needed.
DESC205i output from F213, user can use DES
It is possible to detect from C205 why a certain E:XVAL225 is important. Furthermore, the user uses the why operation to determine the DTE:RM2 whose value caused the EXVAL REQ.
I) TE whose 1st shift is required to attend the value of 11
You can ask why any of the RMS211's are needed, and T I E 21.9 is the DTERM211 of them
DESC 205 is provided to Definition hierarchy (Figure 3) When defining any term, DP207 is DEFS2
Create 13 layers. DE for terms that are being defined
If the F213 eye object does not have any terms, there will be only one level of the hierarchy. 6DEF213 is another term?
If it does, that term must be defined before defining the first term, and is a term in part B1 of the hierarchy that bears two levels to the first term. DE 2 to 2nd level: F21
If any of 3 says another term and 2, then that term needs to be defined and the hierarchy has three levels. In this way, the hierarchy continues to deepen until the DEF 8213 for terms to which other terms are dependent ceases to contain any other terms, but is instead defined only with respect to operations on constants or external values. As is clear from the above explanation, DEF'213
In most cases, the DEF at the top of the DEFEi 213 hierarchy is required to define all the DTERM 211 defined by the DEF 213.
213, but at the same time some other DTERM21
It may come at a lower level in the DEFS2130 hierarchy required to define 1. FIG. 3 conceptually illustrates one of the aforementioned layers of DEF 213. The layer 305 belongs to the cent of DTERM 301.
'r'x: Rus 21.1(,4) to 211 (E
) -1 tech compatible T DEF 213 (AJ color 21
All included in 31Ejl. The definition of the top of floor N305 is DEF213 corresponding to DTERA/211F, 41
(It is Al. DEF 213tA) The display 0P (B, C) in KD is
DEF 213 (AJ indicates that the first shift of DTERM 211 is obtained by performing operations on the DTHARM 211 and (c'I). Similarly, DE:F 213B indicates that DTERM 211 Show that the first shift of DTERM2111D) -J, - and ((phantom) are obtained by performing the operation on the phantom. As a result,
The hierarchy 305 for the DEF 213(,4) has three levels. That is, DEF213 (level 1307 containing only AJ, DEF213 (El and DEF213(C)
Level 2309.2, which includes DEF213(5) and Level 3311, which is called phantom.DEF21
3 (C'l, 213 Kui and 213 (Ko) are other DTER
JI; 211 is not used to define DTERMS 211C, D and E and cannot provide lower levels. Such I) EFS 213 is a terminal definition 312
It is called. When configuring the hierarchy 305, the DP 207
1 (TERM206 compatible with AJ (starting from AJ, T
ERM 206 (ρ is the DESC 205 or definition or Dan definition D where the high level DEF 213 is being configured.
Receive from PC 204. Then, DP207
M211 (, 4J requires DESC 205. DESC 205 defines DTERM 211 (AJ with respect to the operations on Zm (DTERMS 206, B and C). is DH:F21
3<AJ can be made and there is no need to advance further. DEF2131HI”! or DEF213(CI
If there is no intervention, DP'207 will create DEF213A.
13e needs to be made. In this way, DP207 is TE:RM206CIA and T
If ERM206<CI, DESC205f is requested. TERM206 (C) (If D, DESC205 is E;
XVAL((1225, only TERM206(
Cj and DEF 213(C) can be immediately configured. TERM206 (if possible, DESC205 will perform TERM on D and E of two additional TER#J206)
As a result, DP207 descends and generates DEF213 for these TERM206.
, ;request to C206. In both cases, TERM20
6 is defined with respect to EXVAL 225, so that both DEFs 213f can be configured. TERM2
The DEFI 213 reactor configuration for all TERMS206VC related to the definition of 06A was
M206(a to (DTERMS211() corresponding to (gradient)
(1i5), DEF213(,41 can be configured, and TERM206
M211 (,41 are M.) The hierarchy 305 is constructed repeatedly starting from the DEF 213 at the top, and the TE that does not have a corresponding DTERM 211'i
Since only RMS206 is defined, which DTERM2
11 cannot stone two DEF; As a result, DEF 213 in the hierarchy 305 is necessarily full, and DEF 213 (74) in the hierarchy 305 or DEF 2
DE at the top of any hierarchy that incorporates 13CAJ
It is also consistent with F213. As mentioned above, the DP 207 creates the DEF 213'i from the description (DESC) 205. In a prototype embodiment, DESC 205 is created using a description language. The description language includes predefined terms that specify operations on the terms, case statements, and operations to obtain external values. Operations include Boolean K operations, arithmetic operations, and text concatenation. A case statement is a list of pool expression value pairs of the form: (Boolean representation - 1) value 1 - (pool front and back - n) value - r
L (OTHEftWISE)othttrwise-
When a value case statement, containing DEF 213, is evaluated, it is evaluated in order from pool expressions 1 to W 2, or 1, of which one is correct. The DTER corresponding to the correct pool representation is defined by DEF213.
It was around M211. If none of the pool expressions are correct, the DTE will correspond to “OTHERWISE”.
The value is RM211. 2. The description language of the prototype embodiment is used to obtain external value.
Enables you to specify class operations. 1st
, the ASK operation obtains [ from the user's terminal of the expert system 202 . 1st
The ASK operation is used to obtain external values from the terminal. The second class, namely R
The ECORI) operation is used by the database system to obtain such external values. In both cases, the external value may be a number, a text string, or a pool value, or it may be selected from a set of alternative literal rings, ie, one of a term that only refers to itself. The format of the ASK operation to obtain the number 1 shift is as follows. ASK NUMBER' Prompt-String If the DEF 213 that says the ASK order as described above is evaluated, the DP 207 outputs the entire prompt string to the terminal and waits for a number to be input from the terminal. That number is then used in the DEF213 evaluation. The prompt string itself assumes previously defined terms, so that the user's response is made dependent on the value of the previously evaluated term. Pool+! The ASK operation on the s- and text string fields is
When MBER is used instead of YES-No, the text string is obtained in the same way as the ASK operation for several heads except that TDXT is used instead. The form of an ASK operation that selects one of the first parts of a large number of literal rings is as follows. A: EK CHOICE″ prompt-string (
Literal term-1---Literal term-n) ASK
CHOICE ff: When counting all DEFs 213 containing, the prompt string or output requires the user to select one of the literal rings. Then, conveniently using this literal ring fDEF213, the DEF213 force S
The value of DTERM 211 to define can be calculated. The DECORD oilation specifies how an external value is located in the database, and the entire AS except that the database supplies that value at the specified location.
It is similar to the K4th ration. The ovation/of the seal 201 will be explained in detail using a hierarchical tone that can detect whether someone has been hit or not. The legal definition of fraud requires - $1,000 in which one party knowingly makes a false statement to another party, and the other party believes the false statement and suffers an injury. FIG. 4 shows the entire hierarchy of DTERM 211 corresponding to its legal definition. The hierarchy shown in Figure 4 is created by CP2O3 using DEFINEFRA.
Start from where the UD command was received. CP2O3 then sends TERM206FRAUD (fraud) to DP207, and 0P207 requests DESC205' (from the expert who made the leg donation. This DESC 206 further includes two TERMs 206 and a Boolean AND operator.
The value of D (fraud) is DTER corresponding to TERMS206
It is calculated by obtaining the value of M211 and performing an AND operation on it. Since another TEEM 206 is undefined, DP 207 seeks its definition. The expert answered DESC 205 for "false statement" and "Did the defendant know that the statement was false" and DESC 205 for "false statement", and DESC 205 "was the plaintiff aware that the statement was false" and DESC 205 for "I believed it and suffered the damage". Do you believe that the plaintiff has been victimized?'' Since Tani and these other TERM206 are undefined @, is DP207 defined? ! - the expert provides the full definition shown in FIG. DP 207 may ask questions in any order, but in the preferred embodiment the next undefined TEEM
Before proceeding to step 206, all TERMs 2 and 06 necessary to define a given undefined TERM 206 are defined. In the above example, DESC 205 for "false statement,""defendant knew it was a false statement,""plaintiffbelieved," and "plaintiff suffered loss" are all AJK YE:! It contains only the system-defined DTE:RM 211 used for the E No operation, so the DP 207 can provide DH:F 213 for all terms in the hierarchy. DTEEM21 in hierarchy
ASK YH:5 from the user of the expert system 202 who ultimately adopts the definition of fraud.
-NojF-'! It depends on the value the ration demands, and ultimately on what the plaintiff alleges about what happened to him. The use of the fraud definition hierarchy in the expert system 202 allows the user of the expert system 202 to
Begin by entering the WHAT FEAUD command in step 3. CP2O3 is WHAT F for TIE219
Generates RAUD lEC217. To do this, start with "Know the false statement" and then
It is necessary to evaluate DEF 213'i against TERMS 211. Evaluation of ``knowing incorrect statements'' requires evaluation of ``incorrect statements.'' As a result of the evaluation of the DTEEM" 211, the DEF 213 executes a WHAT YES-No violation, and the TIE 219 outputs the prompt "Did you tell me something that was incorrect?". If the user's answer is "NO", the "incorrect statement" is false, "knowing the incorrect statement" is also false, and FRAU
D (j fraud) is also false, so TIE 219 instructs that there is no falsehood and returns TREE 227 to the user. If the user's answer is fYEsJ, T1. E2,19
evaluates whether ``the defendant knew that the statement was false'' and, as a result, questions the user again. Depending on the answer to the question, the evaluation continues or ends. TIE 219 computes f[ for FRAUD and proceeds as described above. As mentioned above, a user of expert system 202 can learn how expert system 202 uses FRAU
A HOW user command can be used to detect if the value for D has been reached. (In the definition of "false statement")
Assuming the user answers "NO" to the question "Did you tell me anything that is not true?", the TIE 219 in the prototype embodiment responds to HOW FRAUD by outputting the following: That is, if "know false statement" is false, FRAUD is "
It is defined as ``knowing about a false narrative, believing it, and suffering damage''. As mentioned above, DP207 is the DEF of DTERM211.
In 213, DESC205 is replaced with DTERM211, and TIE219 is also DTE in DEF213.
Stores external values received to evaluate DEF 213 of RM 211. When executing HOW 4th ration,
TIE219 for the DTERM211 being queried
first receives the DESC 205 from the DEF 213, outputs it, and then outputs the DTE in the DEF 213 as needed to obtain the value of the DTERM 211 being queried.
Evaluate RM211. Otherwise, DTERM 211 is output with their values. If the user wishes to inquire further, HO to other DTERMs 211 specified in the DESC 205 output of the HOW operation.
All you need to do is repeat the double oilation. Also as mentioned above, the user can respond to requests for external values with a value (WHV command).TIE21
If the user responds with WHV in the case of the FRAUD example when 9 asks, ``Did you tell me anything that is not true?'', TIE 219 responds with the following and repeats the question. It is necessary to determine the value of ``knowing the erroneous statement'', which should be defined as ``the person in question knew that the erroneous statement was a false statement''. Again, the information used to respond to the WHV command comes out of DESC 205 stored in DE:F 213 in the hierarchy used to define FRAUD. Regarding this point, if the user wants to know about the
HOW can be applied to the stated DTERM 211 in response to the WHV command. Having outlined the concepts of shell 201 and system 202 configuration operations, the implementation of the first prototype will now be described in detail. Both the first and second prototype embodiments are implemented in the LISP programming language and are implemented in a LISP environment. The LISP programming language and environment are often used to implement prototype and production systems. The specific LISP language used in the prototype implementation is C0MM0N.
LISP, 1984 edition language of Digital Press, Steel, Jr. (Gu, y L, 5teele,
The LISP environment and language described by John Jr., COMPress, (1984) will be discussed herein only to the extent necessary to clearly understand the operation mode of the prototype embodiment. The language is a FORTRAN or PA language that is primarily concerned with the processing of symbols, as opposed to the processing of data represented in programs by symbols.
It is different from languages like SCAL. The basic component of LISP programming is an atom (αtom). Atom is AEC
, or a symbol like a constant. The components are organized into programs by lists without any members, including atoms and other lists. Its members (
) to create a list. (ABC) is a list with one member, symbol AEC. A function appears in LIMP as a list where the first symbol in the list is the function and the other atoms represent the function's arguments. For example, the addition function is r, rs by the tens symbol.
p and specifies that the list (+23) should perform the tens operation on atoms 2 and 3. Any atom, or list, that has a certain value when evaluated by a LISP interpreter is called a form. 53 and (+23) are forms, and if the symbol ABC has a certain value, it is a form. Functions are defined in LISP by the DEFUN function, and the remaining items in List A define the function's name, arguments, and the value to be returned. for example,(
defrbn 5 5 ) defines a function with no arguments and always returns a value of 5. There are a thousand things a LISP program can do with symbols as well as lists, creating them. Since a function definition is simply a type of list, LISP
The program can provide a signal to DEFUN as the name of a new symbol that is being generated by DEFUN, and then use that symbol to execute the newly generated function. A symbol may represent itself as either a signal or a value. If the symbol is displaying itself as a symbol in a LISP ') string. Mark takes the lead. For symbols that represent functions, the value of the symbol is the function. However, if the function is replaced in the list by a list with arguments, and the list is evaluated, the result will be the value at the time the function is executed. Thus '5 indicates the symbol for Dan, while 5 represents DEFUN.
, and (5) indicates function 5, that is, the value that executes 5. Ll! F;P programs are written and implemented in a LISP environment. The products used for the prototype embodiment were Wong La Bora) IJ-'s (Wa
Prof. Ng Laboratories, Inc.
e 5sona 1Computer), Gold Hill Co.
rnputors, Inc.). FIG. 5 is a conceptual block diagram of a typical LISP environment 501. The LISP environment 501 is a LISP environment that evaluates two main elements: the LI:EF form.
Interpreter 503 and Llsp symbol (87M501
) and its definition (SYMDEF509)
It has SP symbols 4-505. DEFUN and certain other LISP functions generate and define new LISP symbols, or redefine previously intervening LISP symbols when evaluated. As a result, LIMP
It can be seen that the interpreter 503 acts not only as a means for evaluating symbols, but also as a means for generating, defining and redefining symbols. The fourth ration of LISP i boundary 501 is as follows. Llf;P When a user of the environment 501 types a list containing a form such as (5), the LISP interpreter 503 replaces the symbol 5 with the symbol su1! -S505
Evaluate the form by positioning it in the SYM
Detect what DEF509 is and then SYMDEF5
Interpret 09 and calculate the value of 5. In this case, SYMD
EF509 is the code for the function of 5 generated by evaluating the expression of DEFUN, and by its interpretation, 5 is generated by evaluating the expression of DEFUN.
, and the interpreter interprets it as

It is returned to the user as the value of [5]. r, rsp interpreter 503 uses SYM 507 and corresponding SYMDEF 509'! - occurs, symbol S<-
Since x 505 can be located in the memory L% symbol base 505, the LISPi environment 501 is
It automatically performs oiling, which is difficult to achieve in other languages and is essential for expert system shells and expert system operations. Therefore, L
ISPM environment 501 was the preferred environment for creating the prototype expert system 2 and expert system shell. As will be seen from the following description, the prototype of the present invention takes full advantage of the symbol generation, definition and positioning operations. In the first prototype embodiment, the expert shell 201 and the expert system 202 are LISP
Realized by functions. FIG. 6 provides an overview of the functionality of LISP and relates it to the elements of FIG. 2 and the input and output sides of these elements. Thus, the LISP functions that make up CP2O3 are included in the dotted box with that label, the functions that make up DP207 are included in the dotted box with that label, and the TIE219
are included in the dotted box with that label. TE 101 is implemented in a first prototype by an r, rsp symbol base 505 that stores LISP symbols and their definitions. The elements of the first prototype embodiment also include L
Execute the ISP function and enter the symbol base 505.
SYMS507 and SYMD generated by elements in
SYMS 507 and their SYMDEFS 509. Regarding the expert 603, the expert 603 performs the functions of the CP' 203 in the program F. Expert 603 receives the input string and appends zeros around it to create the CFOR
When the LISP interpreter 503, which creates a LIF:P form called M605 and performs the EVAL operation on it, evaluates the form, it processes the first symbolic LISP function name in form A, and names the remaining items in form A. Treated as a list of arguments for the function with . The expected input string for the expert 603 is the command for the DP 207, namely DEFINE, RE.
DH: FINE, UNDEFINE and TIE219
command for, ie, WHAT. HOW, ASSUMELRE: JET, DEFINIT
ION%5AUE, WHY and RESTORE. DEFINE%REDEFINg, 2 and UNDH:F
INE corresponds to DPC 8204 in FIG. 2, and the remaining strings correspond to IEC 8217 in FIG. In a first prototype embodiment, expert 603
No error is detected. However, in a commercial embodiment, extract/sheet 603 includes a coat that detects and responds to incorrect input. As can be seen from Figure 6, I) P2O3 is the LIMP function, DEFINE, REDEFINE and UNDEFI.
Implemented in the first prototype by NE. Expert 603 is like FEAUD for example! TEEM
206. ! : Both receive the DEFINE command (DEFI
NE FEAUD) to the LISP interpreter, and the LISP interpreter 503 provides the argument FRA
Call the DEFIME function by UD. DEFIME is DE from the user! Request ECM, 05 and use DESC205 to set DEF2 for FRAUD.
Provides 13. As explained in more detail below, the result of the call is a LISP function called FRAUD, for which DEFUN is: (defun FRAUD () (prog2 (push 'FRAUD arg-stack)
(AND (“Know the false statement”) (“Believe it and suffer damage”)) (1(IAτg-stack)ノ)))FRA
In the process of defining UD, we found that ``knowing of the false statement''2, ``believing it and suffering damage'', and DT
All ERMs 211 are defined as r, rsp symbols representing LIMP functionality. AND is a predefined LISP function that performs an AND operation on its arguments. The value returned by the FRAUD function is the result of an AND operation. DTERMS211, which is defined as a LI:SP symbol representing a LISP function, will be referred to as TSY in the following explanation.
MS615, their definition is a prototype implementation of DEF8213, and TDE
It is called FS617. LISP interpreter or DE: TSYMS 615 s, - and TD in response to FIME function
As EFS 617 are generated, they are placed in symbol sweep 505. T in 2 for the first prototype
The DEF617 is shown in FIG. As shown in Figure 7, T
TF which is a LISP function displayed by SYM615
D, which was the source of the definition of UNC701 and TSYM615
It includes TDESC 705, which is a modified copy of F:5C 205, and TEXVAL 103, which contains the last EXVAL 703 defined by the user of expert 202 for TSYM 615. The remaining functions in DP 207 are called similarly to DEFINg from EXPERT 603. DEDEFIME is first of all TSYM which is being redefined.
We adopted LISP oiling to remove TFUNC701 and TDE;C705 from TDEF617 for TDEF615, and then called DEFIME to create TDEF6
17 and create new values for TFUNC701 and TDE;5C705. UNDEFINE simply removes TFUNC 701 and TDESC 705 without defining a new TSYM 615. TIE219 in first prototype embodiment 601-2
To explain the realization of LISP interpreter 5
03 shows zgczx7 all thorns EXFEET 6t
When receiving CFORM605 from J3, CFORM6
05 is executed. As the functions of TIE 219 are executed, they provide forms created from TSYM 615 (TPORMS 639) to interpreter 505, which evaluates those forms and returns the results (TFORM RESULT) to the function being executed. vinegar. The functions of TIE219 are TIg219 and ARG.
4TACK 635, TERMS-:5TACK613
j? and SYM-EOUND-LIST are adopted. Let's start explaining about AEG-3TACK635. ARG-8TACK635 is TSYM
615 - 10,000-defined TS
The value of YMS615 is calculated. As you can see from the code of the process for FRAUD above, before the AND operation that defines FRAUD is performed, it is pushed into ARG-8TACK, and then ARG-8TA
Released from CK. TERMS-8TACK613 is a stack of TSYMS615. The stack is TS
TDEF617 of YM615 is the first TSYM61
5 is ordered with 1 at the bottom and the last one at the top of the TDEF617 total stack. As explained in detail below, the final T:EYM 615 is typically the one whose TDEF 617 is at the top of the definition hierarchy. SYM-BOUND-LIST637 is currently E
TSYMS615 dedicated to XVALS225
This is a list of Referring to the LISP function of TIE 219 with WHAT function 619, this function is executed in response to a WHAT command to EXPERT 606. The above command is WHAT DTERM611
It has a form of For FRAUD, its form is WHAT FRAUD, for which EXPERT603 is entered (WHAT FRAUD)
. WHAT function 619 first uses a LISP function to detect whether its argument is TSYM615, and if so, this LISP function calls another LISP function that extracts the n pin number, which is the function name, as an argument. and calls that function, in this case FRAUD. The result is TFUN in TDEF616 for FRAUD
This is the execution of C701. When the TFUNC 701 is executed, the FRAUDO value is detected, and then the TFUNCS 701 for "false statement" and "I believed it and suffered damage" is executed. Predetermined TSYM61
When TFUNC701 for 5 is executed, the predetermined T
: Any one that needs to find the value of EYM615
TFUNC8701 for 87MS615 is enforced. When all the necessary TFUNC8701 are executed,
The values obtained from these runs are returned to the user of system 202 as TRES 227. That TFUNC70
1 requires Ex11L225, given that TSYM615 already has such a value, T:EYM6
15 is on SYM-EOUND-LIST637 and 2, TFUNC701 is TD for TSYM615
Use TEXVAL703 in EF617. Otherwise, TFUNC 701 generates an EXVAL REQ and obtains EXVAL 225 for the user. Thus, together with LISP interpreter 503, the WHAT function operates as a reasoner that determines the value of TSYM 615, which is determined by external values and whose definition is located at the top level of the hierarchy. Furthermore, as long as TFUNC701 called as a result of WHAT oilation is active, the corresponding TSYM615 will receive ARG-8TACK.
It is on 635. If OW function 623 is executed in response to the HOW command and meets TSYM 615'i. now
Function 623 takes the above T;
-1 LISP function that is CTION and T
Use the other LISP function that obtains the third element in the third list of FUNC701. As can be seen from the FRAUD function above, said element is a list that defines the operations from which the value of the function is obtained, i.e. (AN
This is list D (``I believe it and suffered damage''). The HOW function searches the list and finds the T used in the HOW command;
TIE to display TDESC705 for YM615
Use DEFITION of 219, then TFUNC7
It searches from 01 and evaluates 187MS615 of Strike A, and outputs the results along with appropriate explanatory text. A user of expert 202 can enter WHV commands into either H:XPERT 603 or TIE 219 in response to EXVAL PEQ during evaluation of TSYM 615. The WHV function uses TS as an argument.
Can be called with or without YM615. However, the function is TSYM615, which corresponds to the currently evaluated TFUNC701.
and its evaluation is EXVAL to which the user can respond.
In cooperation with the TSYM615 currently on top of the ARG-8TACK635, which generated Rli:Q, the function is
Collaborate with 5. In either case, the following process resulted in the evaluation of the function T) vNC 701 whose evaluation corresponds to TSYM 615, whose evaluation is being processed by WHV.
The preceding TSYMS1 is TSYMS15 corresponding to
5 at ARG-8TACK635. Without the intervention of the preceding TSYM 615, the WIIY command is meaningless and the corresponding message is output to the user. If a preceding TSYMS 15 is present, DEFINITION is used to output the definition for the preceding TSYM 615 along with appropriate explanatory text. Following the DEFINITION function, the EXPERT 6031 instruction that calls the function is:
TSYMS either as an argument or as a non-argument
Can you have 15? Firstly, TDESC705 of TDEFS17 is an output and secondly, TERMS-
TD for all TSYMS615 on STACK613
ESC705 is the output. The ASSUME function is called with an ASSUME command that specifies TSYMS15 and some value. TgYM615 has its value TFUNC701 EXV
Must require AL 225. A.S.
SUME first empties ARG-8TACK635 so that TSYM61 is cleared before the WHV command follows.
5 is reevaluated and then TEXVAL of TDEFS17
703 as an argument (set to direct, set TSYMS15 to SYM-EOUND-Ll, S'7
'613 to indicate that it has TEXVAL703. The RESET function shall be called by an Rk:SET command with or without specifying TSYMS15. First, TD corresponding to TSYMS15)
! : Only TEXVAL 703 of F617 is reset, secondly all TEXVALS 703 are reset. The RES ET function is first of all ARG-
Empty STACK635. If TSYM615 is specified, RESET
The function is TEXVAL703 and TSYMS15.
, effectively removing TDEF 617 and TSYMS15 from SYM-EOUND-LIST63
Remove from 7. If TSYMS15 is not specified, EESE
T is each TSYM of SYM-BOUND-LIST637
Perform the operations described above on 615. The 5AVE function creates a file containing DEFIME instructions for each TSYM 615 followed by a TDESC 705. DEFINE command TERMS-8
TSYMS 615 occurs in the order TACK 613 occurs. 5AVE is each T in TERMS-8TACK613
It works for SYM615 by outputting the following to a file. namely, the string DEFINE, TSYM 615 representing the string, and TDESC 705 representing the string for TSYM 615. The resulting file is TDh; the DE on which SC705 is based
TDE in the order in which the SC8205 was input to the DP 207
Includes SC705. The RESTORE function restores the previously saved TSYMS15. The restoration is performed by performing a LISP load operation on the file. In a load operation, the file's LIS
P symbol is evaluated. In this case, the evaluation result is TSYI
1615 and DEFIN in the restored file.
What is the product of those TDEF 617 specified by the E instruction? Detailed explanation of DEFINE607 (Figure 8) Figure 8 shows DE
TSYMS61 with a predetermined set of FINE functions and DEFINE functions to be called
We fully demonstrate how to inductively create a TDEFS6170 hierarchy for 5. As mentioned above, DEFIN
The way E creates the TDEFS617 hierarchy is Tani T A
l'RA/206 is fully defined and for a given T
Full guarantee that ERM 206 has only one definition. Figure 8 shows the main functions called by DEFINE%DEFINB, and TSYMS615 and TD
It shows how the EFS 617 and all generated data flow between the functions. DEFINE607 is TERM206 to DTERM2
Make 11. When DEFINE returns all DTERM 211, TSYMS 15 and TDEFS 17 corresponding to DTERM 211 have already been created. DEF
INE607 is F:XPERT603 and RESTORE
633. Plus itself and PRO
CESS-FUNCTION 811 is called recursively. EXPERT 603 provides CFORM 605 containing the DEFINE symbol and TERM 206 to be defined. RESTORE633. If so, DEFIME607 is TERM206 and TDE
Provide a copy of SC705 and all GETDEF805,
Returns the value returned by GETDEF 805, i.e., the list whose element is TERM 206). TERM
206 was not provided by RESTORE 603, DEFINE 607 is already interposed by TSYM 615 for TERM 206 or TER
It is detected whether M206 is a literal (that is, there is no copy of TDESC 705). If any of the above, DEFIME indicates that the element is TERM2
06 and the list money is returned. If none of the other cases were correct, GETDEF 805 returns Tl#SC705
Called by DIEFINE 607 without any code. GETDEF 805 receives an undefined term (UTERM) 803 from DEFINE 607 and can also receive a copy of TDESC 705 for the term. In the first case, GETDEF receives DESC205 from the user.
obtain. The second case is simply the CFORM605 containing the DEFIME symbol and the previously saved DTERM.
TERM 206, which is a copy of 211 and a copy of TDESC 705 to DTERM 211, is provided. When DEF-INE 607 is called recursively, its input is TERM 206, which is used in DESC 205 of another TERM 206 being defined. Generally, TERM 206 is one signal, but DE
If SC205 contains a case statement, TER
M206 may be a list, in which case DEFINIi: calls C0NVERT 809 to convert the list to LIST form, then calls itself recursively to
Define each undefined TERM 206 in the ISP form. Next, DEFINE607 is TERM20
6 or a LISP symbol. If not, DEFIME 607 simply returns TERM 206 unchanged. If so, DEFINE60
7 only uses TDESC 705'i to detect whether Tk:Ru2O3 is provided by RESTORE 633. Next, GETDEF 805 is C0NVERT
809 all calls it in LISP form CDE
Convert to SC807. Next, UTERM803 and CD
ESC807 and PROCESS-FUNCTION8
Provided for 11n, PROCbj8g-FUNCT
ION 811 is Tk:UN for UTERM811
Return C701. Finally, GETDEF 805 is TSYM615 all T
Located in ERMS-8TACK 613, UTERM
The list consisting of the DTERM 211 corresponding to the DTERM 803 is returned to the entire DEFINE 607. C0NVERT809 is DEFINE607 or G
Called by ETDEF805 - go. C0NVERT
809 receives DESC205f LI from the called party.
Convert to SP form, that is, CDESC807, and
Return L to the callee. PROCk:5S-FUNCTION 811 is UTE
Receive RM803 and CDk:SC807 and send to UTER
M803 DEFINE-1i'UNCTION813
, receive TFUNC701 from DEFINE-FUNCTION 811, and get TFUNC701.
Dk; Return to F2O3, 1 is undefined CDES
U is a list of UTERMS 803 from C807
Create TERML815. Next PROCF:5S-F
UNCTION is each UTERM of UTERML 815
DEFIME 607 is called for 803. Finally, DEFINE-FUNCTION 803 is TFU-
Generate and evaluate Dli:FUN for NC701 to create TFUNC301, and PROC
Return to ESS-FUNCTION 811, PROCE
For SS-FUNCTION 811, TFU-NC7
Return 01 to GE:TDEF805. As can be seen from the foregoing discussion, the recursive call to DEFINE 607 continues until all of the TERMs 206 necessary to define the TERM 206 for which DEFIME was called have been defined. Only in that respect is DEFINE 606 TERM
206 is returned. shell 20
1 user needs to define all Tk:Ru2O3 required to define a given TERM206, TEE
Since you only need to give one definition for M206,
DEFINE 606 ensures a complete and consistent set of definitions for TERM 206. Prototype Example 2 (Figure 9) Prototype Example 2 has many improvements over Prototype Example 1, including a better interface for the user and more reliable recovery from user errors. Has improvements. Prototype Example 2 The most important improvement included is an alternative embodiment of the TDEF617 and WHAT shown in the schematic diagram of FIG. TDEF901 is TDES like TDEF617
C705 and TEXVAL 703. TDEF901 does not contain TFUNC701,
Contains two new fields, TFORM 903 and TTYPE 905. Changes were made to eliminate the problems of Prototype Example 1. That is, the TERM 206 to be defined corresponds to other LISP symbols already in the symbol base 505. In that case, TER,'v
1206, the definition obtained by DEFINE 607 &-1 gives priority to the definition that existed before the signal. In prototype example 2 tic, TFUNC70
1 cannot be implemented as a function by itself, but TIE
EVALUA-TOR function 9 in 219
TF, which is a LISP form that can be implemented by
The problem is solved by replacing it with OEM903. TTYPE905 is TFOEM905 EVALUAT
Contains information regarding the types of values that are sucked back performed by OR911. The rest of FIG. 9 shows W in prototype embodiment 2.
HAT function 907 and gVALU-ATOR9
11 is shown. WHAT 907 is the EXPERT 603 to WHAT CFO as in the previous example.
RM 605 but simply LISP for 187M615 provided as argument to WHAT
In order to perform the EVAL operation, TSYM615
EVA TFOR1v1903 from TDEF901 for
Provided to LUATOR911, EVALUTOR91
1 creates a LISP7ohm that performs the operations specified in TFORM903, and converts the form to LIS
Provided to P interpreter 503. The LISP interpreter 503 uses EVALUA to evaluate the LISP form.
The EVALUator 911 provides those evaluation results to the TREs 227, and the TRES
227 is returned to WHAT 907, and WHAT is returned to the user. CONCLUSION This preceding description of the preferred embodiment has disclosed the best mode presently known to the inventors for implementing the new expert shell and the new expert system. Although this expert system is not as powerful as the prior art one, it still has many of the most important advantages of the prior art expert system.
It is particularly well suited to situations where what is required of an expert system is detailed knowledge of a complex procedure. The expert system shell in accordance with the present invention precludes prior art expert system shell rules and ensures that the definitions that make up the expert system's knowledge base are complete and consistent. The expert system shell and expert system disclosed herein are those in which the knowledge base used by the ExHeart system has a predetermined definition in the hierarchy [with definitions lower than itself] and sources external to said knowledge base. It is based on the fact that it consists of terms defined by a hierarchy of definitions that depends only on the external values obtained. The expert system calculates υ by asking the user to supply one or more extrinsic values and then using the extrinsic values and a hierarchy of definitions to discover what value would be produced for a term. Term G makes a related inference. A hierarchy of definitions is created in the expert system shell by requesting the definition of the terms used to define a given term in one in which all terms are fully defined, so that the definition of a given term is dependent. ensure that definitions provided are complete and consistent. Although the embodiments disclosed in this specification were implemented in an ISP, implementation of the present invention is not limited to LISP in any way. However, it is a prototype and is intended to be purely illustrative. As such, the disclosed embodiments are to be considered in all respects illustrative and non-limiting, and the scope of the invention is limited by the foregoing. It is intended that the meaning and range of equivalents of the claims be within the scope of the present invention.

[Brief explanation of the drawing]

FIG. 1 is a conceptual block diagram of an expert system according to the prior art, FIG. 1A is a conceptual block diagram of an expert system shell according to the prior art, and FIG. 2 is a conceptual block diagram of an expert system shell and an expert system according to the present invention. A conceptual block diagram; Figure 3 is a conceptual diagram of the hierarchy of definitions used in the present invention; Figure 4 is a diagram of terms and descriptions used to define the term FRAUD; Figure 5 is a diagram of the LISP environment, Figure 6 is a schematic diagram of the first prototype embodiment of the invention, Figure 7 is a diagram of the TDEF617 of the first prototype embodiment, and Figure 8 is the first prototype. Example function DEFI
and FIG. 9 is a diagram of certain improvements in the second prototype embodiment. In the figure, 203...Command input means 204...Definition processor command 205...Description of a predetermined term 206
...Term 207...Definition analysis means 211...Hierarchical definition term 213...Definition 215...Knowledge base 217...Inference mechanism command 219...Inference mechanism 225...External value 1i 's, +07 IGI Ward Ko's, 94 (no change in content) FIG, 5 TDEF617 FIG, 7 Number of people writing 505 (T3215) DTEI? M 27 no DEF 2
/3FIG, 9 7SYM615 Procedural amendment (method) % formula % 3. Relationship with the case of the person making the amendment Applicant Address Name Kuoshiku °'・U±゛°Rad sauce °, Ishifujiru, 'L-7, I -4, Agent 5, Date of amendment order LJ1, October 1920 (Shipping mill) 6, Drawings subject to amendment

Claims (1)

[Scope of Claims] 1) Contains a hierarchically defined term and a definition of the term, where the corresponding definition of each term is an external value or knowledge base of the term that has a definition at a lower level in the hierarchy. and a stored knowledge base that defines the term in terms of extrinsic values in the corresponding definition, and by obtaining the value of any term in the corresponding definition and any extrinsic value, and an expert system in a digital computer system, comprising: inference means for detecting a value of a predetermined term from a corresponding definition by creating a value of the predetermined term from a corresponding definition. 2) In a definition system in a digital computer system that creates a hierarchy of definitions for terms, where each term is defined in terms of another term or terms that are independent of another term at a lower level in the hierarchy; a storage means containing definitions corresponding to the terms; and receiving a given term, obtaining a description of the given term, and detecting whether the requested description includes any other undefined terms; If not, define a given term from its description and the definition of any defined term, provide that definition to said storage means, and if it does, define another undefined term. Obtain the description of the term and thus perform the analysis on the given term until no term remains undefined in the description of the given term or in any description obtained in the course of the analysis. A definition system including a continuing definition analysis means. 3) In a method in a digital computer system that constitutes a set of defined terms to be used in an expert system, for any undefined term, a user of the digital computer system requests a description of the undefined term. obtain, detect whether the requested description contains any other undefined terms, and if the requested description does not contain any undefined terms, the obtained description and the defined Create a definition of an undefined term from the description of the term, and if it contains an undefined term, include a process of repeating the preceding process for another undefined term, and repeating the previous process. A method of constructing a set of defined terms by repeating the above process for each additional undefined term included in any of the definitions obtained during the iteration. 4) A command input means for receiving shell commands from a user of the digital computer system, and a hierarchy definition that responds to shell commands and defines the value of a term with respect to the value of a term at a lower level of the hierarchy or a value from outside. a definition processing means for specifying a definition of a term for the purpose of obtaining a definition, a knowledge base storage means for storing the definition; and inference means for requesting the current value of a given term whose definition is included in the knowledge base storage to detect the value of the term and producing the value of the given term specified in the definition of the given term. Expert system shell in computer systems.