US5263127A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for fast rule execution of expert systems
Assignee: DIGITL EQUIPMENT Corp
•
Filing: 1991-06-28
•
Granted: 1993-11-16
•
Expires: 2011-06-28
Abstract
Abstract The present invention includes an approach to improving run-time performance of rule-based systems. A series of testing element nodes making up a testing element is adapted to a match discrimination network utilized in an expert system to permit scanning of incoming data prior to traversing large segments of the nodes in the match discrimination network. By placing a series of testing element nodes into a traditional match discrimination network, interaction among data objects and nodes of the match discrimination network are minimized.
Inventors
- 👤 William Barabash
- 👤 Steven A. Kirk
- 👤 William S. Yerazunis
- 👤 Kenneth A. Gilbert
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 14:53
CPC Classifications
G; G06; G06N; G06N5/00; G06N5/04; G06N5/046; G06N5/047
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
127 words
A method of rule execution for an expert system comprising the steps of: a. storing in a computer memory a plurality of nodes arranged in a match discrimination network; b. allocating program modules in said computer memory, said program modules having data declarations containing at least one of a plurality of data types; c. providing to said match discrimination network a testing element containing at least one testing element node, said testing element node containing a test in accordance with said data declarations; and d. associating said plurality of nodes of said match discrimination network into at least one group having a first one of said nodes coupled to said testing element node in said testing element in accordance with said test associated with said test node.
Claim 2
Independent Claim
127 words
A method of rule execution for an expert system comprising the steps of: a. storing in a computer memory a plurality of nodes arranged in a match discrimination network; b. allocating program modules in said computer memory, said program modules having data declarations containing at least one of a plurality of data types; c. providing to said match discrimination network a testing element containing at least one testing element node, said testing element node containing a test in accordance with said data declarations; and d. associating said plurality of nodes of said match discrimination network into at least one group having a first one of said nodes coupled to said testing element node in said testing element in accordance with said test associated with said test node.
Claim 3
Dependent Claim
15 words
The method of claim 1 wherein said data declarations contain at least one unique key.
Claim 4
Dependent Claim
21 words
The method of claim 2 wherein said at least one of unique key is coupled to said corresponding testing element node.
Claim 5
Dependent Claim
15 words
The method of claim 2 wherein said unique key comprises a 32 bit integer value.
Claim 6
Dependent Claim
15 words
The method of claim 2 wherein said unique key comprises a 64 bit integer value.
Claim 7
Dependent Claim
24 words
The method of claim 2 wherein said unique key comprises a uniquely determined prime number in the range of 0 to 2 64 .
Claim 8
Dependent Claim
107 words
The method of claim 6 wherein said uniquely determined prime number is provided by the step of: using a hashing function located in the expert system program with at least a first one of: a. a source code file length; b. said source code file checksum; c. said source code file characteristics; d. said source code file modification date; e. said source code file modification time; f. said source code file creation date; g. said source code file ownership; h. said source code file location in a local file system; and i. said source code file location in a networked file system; to provide said unique key.
Claim 9
Dependent Claim
105 words
The method of claim 2 wherein said unique key is provided by the step of: using a hashing function located in the expert system program with at least a first one of: a. a source code file length; b. said source code file checksum; c. said source code file characteristics; d. said source code file modification date; e. said source code file modification time; f. said source code file creation date; g. said source code file ownership; h. said source code file location in a local file system; and i. said source code file location in a networked file system; to provide said unique key.
Claim 10
Dependent Claim
21 words
The method of claim 1 wherein said step of providing said testing element allocates a plurality of said testing element nodes.
Claim 11
Dependent Claim
117 words
The method of claim 1 wherein said step of storing in said computer memory a plurality of nodes arranged in a match discrimination network in computer memory further comprises the step of providing a working memory in said computer memory, said working memory divided into a plurality of working memory elements associated with each of said program modules, each working memory element containing a unique key, wherein said method further comprises the step of: passing selected ones of said working memory elements through said testing element to the first one of said plurality of nodes in accordance with an associated key of each of said working elements and the at least one key of said testing element.
Claim 12
Dependent Claim
162 words
The method of claim 10 wherein said step of passing said selected ones of working memory elements to said at least one testing element node in said testing element further comprises the steps of: i. comparing in said at least one testing element node a unique key of a first one of said working memory elements with a unique key of said testing element node; ii. passing said first working memory element onto said match discrimination network if said unique key of said first working memory element and said unique key of said testing element node match; iii. aborting further providing of said first incoming working memory element for a failure to match said unique key of said first working memory element and said unique key of said testing element node; b. continuing said providing of succeeding ones of said incoming working memory elements until there are no further working elements to compare; and c. outputting the matches as a conflict set.
References Cited (Backward Citations)
US4965882A
Cited
US5129037A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-11-15 | 1997-05-17 | 1997-11-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-15 | 2001-05-17 | 2001-11-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-15 | 2005-05-17 | 2005-11-16 | $7700.00 | Window Closed / Lapsed |