Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
202 words
In an artificial intelligence system a method of collecting data by tracing a rulebase of an Expert System program with a data processing system having a processing unit and a memory subsystem which functions with said Expert System program as an inference control engine, the improvement comprising in combination the steps of: (1 ) storing in said memory sybsystem a second program which is operable in cooperation with said processing system to develop a predetermined set of data; (2) calling with said Expert system program said second program in response to tracing a Rule tree that contains a predetermined type node that contains ID data that identifies said second program, said step of calling further including the step of converting said ID data to a pointer for locating an address of said second program in said memory subsystem; (3) operating said second program with said data processing system to develop said set of data; (4) transferring said set of data developed by said second program to said predetermined type node after said second program is executed by said data processing; and (5) processing with said inference control engine said Rule tree to a Goal node based on said transferred set of data.
Claim 2
Dependent Claim
202 words
In an artificial intelligence system a method of collecting data by tracing a rulebase of an Expert System program with a data processing system having a processing unit and a memory subsystem which functions with said Expert System program as an inference control engine, the improvement comprising in combination the steps of: (1 ) storing in said memory sybsystem a second program which is operable in cooperation with said processing system to develop a predetermined set of data; (2) calling with said Expert system program said second program in response to tracing a Rule tree that contains a predetermined type node that contains ID data that identifies said second program, said step of calling further including the step of converting said ID data to a pointer for locating an address of said second program in said memory subsystem; (3) operating said second program with said data processing system to develop said set of data; (4) transferring said set of data developed by said second program to said predetermined type node after said second program is executed by said data processing; and (5) processing with said inference control engine said Rule tree to a Goal node based on said transferred set of data.
Claim 3
Dependent Claim
43 words
The method recited in claim 1 in which said data processing system includes a plurality of hardware units and the step of operating said second program further includes the step of exercising a predetermined one of said hardware units to develop said data.
Claim 4
Dependent Claim
79 words
The method recited in claim 2 further including the steps of, storing a plurality of other programs in said data processing system, each of which when executed exercises a different one of said hardware units to develop data for use in said Expert system, and establishing a list of Procedure records corresponding to said Procedure nodes, each said record defining a different external procedure corresponding to one of said other programs that is on-line to said data processing system.
Claim 5
Dependent Claim
34 words
The method recited in claim 3 which further includes the step of dividing each of said records into a plurality of fields and assigning to each said field a predetermined attribute of said procedure.
Claim 6
Dependent Claim
49 words
The method recited in claim 3 in which said step of calling said second program includes the step of locating one of said Procedure records in said list of Procedure records which corresponds to said second program that is identified by said predetermined type node of said Rule tree.
Claim 7
Dependent Claim
85 words
The method recited in claim 4 further including the step of establishing with said Expert system a hashing table in the memory of said data processing system, said table having a plurality of memory address locations, each of which includes a pointer to one of said records on said list and said step of locating includes the further step of converting said ID data of said procedure in said predetermined type node to a memory address in said hash table by a predetermined hashing algorithm.
Claim 8
Dependent Claim
43 words
The method recited in claim 4 further including the steps of establishing at least one field in each of said Procedure records that contains data that can be varied; and passing said data in said at least one field to said second program.
Claim 9
Dependent Claim
45 words
The method recited in claim 6 in which said second program causes operation at two different times of two separate but similar functional hardware units in response to different said data being passed to said second program at said different times in said variable field.