US5023807A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for producing discrimination nets for expert systems
Assignee: Hewlett Packard Development Co LP
•
Filing: 1990-10-03
•
Granted: 1991-06-11
•
Expires: 2010-10-03
Abstract
Abstract An expression comprising conditions is evaluated based on values of data elements presented to a network of a kind in which the conditions are represented by nodes and the relationships among conditions in the expression are represented by links among the nodes, by storing information that identifies which conditions represented by at least some of the nodes have been satisfied by the values of the data elements, and testing the stored information in accordance with the expression as a basis for evaluating said expression. In a second aspect, an expression that comprises conditions which pertain to possible values of data belonging to categories of data is evaluated based on actual values of data presented to a network of a kind in which the conditions are represented by nodes, by identifying a category of data for which values need not occur in the network in order for a condition that requires a value in the category to be provisionally satisfied, and causing the node that represents the condition to indicate that the condition is provisionally satisfied even when no values in the identified category occur in the network.
Inventors
- 👤 Kamesh Ramakrishna
- 👤 Meyer Billmers
- 👤 Daniel Theriault, deceased
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 08:53
CPC Classifications
G; G06; G06N; G06N5/00; G06N5/04; G06N5/046; G06N5/047
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
110 words
A network for evaluating an expression comprising conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said network comprising storage for holding information that identifies data elements that have values which satisfy one or more of said conditions represented by at least some of said nodes, and an analyzer for testing said stored information by applying said expression to said stored information to determine whether a combination of date elements presented to the network have values that satisfy one or more of a plurality of combinations of said conditions.
Claim 2
Dependent Claim
110 words
A network for evaluating an expression comprising conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said network comprising storage for holding information that identifies data elements that have values which satisfy one or more of said conditions represented by at least some of said nodes, and an analyzer for testing said stored information by applying said expression to said stored information to determine whether a combination of date elements presented to the network have values that satisfy one or more of a plurality of combinations of said conditions.
Claim 3
Dependent Claim
44 words
The network of claim 1 wherein said storage comprises separate locations assigned to said information from different ones of said some nodes, and further comprising means for entering said information from each one of said some nodes into the location assigned to said node.
Claim 4
Dependent Claim
51 words
The network of claim 2 adapted for use wherein said expression is satisfied if a predetermined number of said conditions in said expression have been satisfied, and said analyzer counts the number of locations that are occupied with said information to determine how many conditions in said expression have been satisfied.
Claim 5
Dependent Claim
57 words
The network of claim 2 wherein said expression includes an indexing condition represented by a node, and further comprising means for establishing groups of said locations in said storage based on information from said indexing condition node, each one of said groups being associated with one or more of said data elements that satisfy said indexing condition.
Claim 6
Dependent Claim
12 words
The network of claim 1 wherein said network is a discrimination net.
Claim 7
Dependent Claim
13 words
The network of claim 5 wherein said discrimination net is a reticular net.
Claim 8
Dependent Claim
27 words
The network of claim 1 wherein said analyzer determines that said expression is satisfied if any one of said conditions represented by said some nodes are satisfied.
Claim 9
Dependent Claim
30 words
The network of claim 1 wherein said analyzer determines that said expression is satisfied if at least a predetermined number of said conditions represented by said some nodes are satisfied.
Claim 10
Dependent Claim
30 words
The network of claim 1 wherein said analyzer determines that said expression is satisfied if at most a predetermined number of said conditions represented by said some nodes are satisfied.
Claim 11
Dependent Claim
226 words
A network for evaluating an expression comprising conditions, the evaluating being based on whether a combination of data elements presented to the network have values that satisfy a combination of said conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said expression including an indexing condition represented by a node, said network comprising storage for holding information that identifies data elements having values which satisfy one or more of said conditions represented by at least some of said nodes and identifies data elements that satisfy said indexing condition, said storage comprising separate locations assigned to said information from different ones of said some nodes, means for entering said information from each one of said some nodes into the locations assigned to said node, means for establishing groups of said locations in said storage based on information from said indexing condition node, each one of said groups being associated with one or more of said data elements that satisfy said indexing condition, said means for entering enters said information from said some nodes in the locations of the group that corresponds to said identified data elements, and an analyzer for testing said stored information in accordance with said expression as a basis for evaluating said expression.
Claim 12
Dependent Claim
226 words
A network for evaluating an expression comprising conditions, the evaluating being based on whether a combination of data elements presented to the network have values that satisfy a combination of said conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said expression including an indexing condition represented by a node, said network comprising storage for holding information that identifies data elements having values which satisfy one or more of said conditions represented by at least some of said nodes and identifies data elements that satisfy said indexing condition, said storage comprising separate locations assigned to said information from different ones of said some nodes, means for entering said information from each one of said some nodes into the locations assigned to said node, means for establishing groups of said locations in said storage based on information from said indexing condition node, each one of said groups being associated with one or more of said data elements that satisfy said indexing condition, said means for entering enters said information from said some nodes in the locations of the group that corresponds to said identified data elements, and an analyzer for testing said stored information in accordance with said expression as a basis for evaluating said expression.
Claim 13
Dependent Claim
48 words
The network of claim 10 wherein said expression is satisfied if a predetermined number of said conditions in said expression have been satisfied, and said analyzer counts the number of said locations in each group that are occupied with said information to determine whether said expression is satisfied.
Claim 14
Dependent Claim
26 words
The network of claim 11 wherein said analyzer monitors whether each said group currently has a count of occupied locations that indicates satisfaction of said expression.
Claim 15
Dependent Claim
28 words
The network of claim 12 wherein said analyzer counts said occupied locations in a group each time a new entry of said information is made in said group.
Claim 16
Dependent Claim
55 words
The network of claim 13 wherein said analyzer produces an indication that said expression is satisfied if a new entry of said information causes a group that did not previously have a count of occupied locations that indicated satisfaction of said expression to have a count of occupied locations that indicates satisfaction of said expression.
Claim 17
Dependent Claim
42 words
The network of claim 14 wherein said analyzer refrains from producing said indication if said group already had a count of occupied locations that satisfied said expression at the time that said new entry of said information is made into said group.
Claim 18
Dependent Claim
51 words
The network of claim 11 wherein said some nodes are adapted to cause said information to be deleted from corresponding occupied said locations in said storage, and said analyzer is adapted to count the occupied locations in a group each time said information is deleted from a location in said group.
Claim 19
Dependent Claim
51 words
The network of claim 16 wherein said analyzer produces an indication that said expression is not satisfied if a deletion of said information causes a group that previously had a count of occupied locations that satisfied said expression to have a count of occupied locations that does not satisfy said expression.
Claim 20
Independent Claim
104 words
A method for evaluating an expression comprising conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said method comprising storing information that identifies data elements having values which satisfy one or more of said conditions represented by at least some of said nodes; and testing said stored information by applying said expression to said stored information to determine whether a combination of data elements presented to the network have values that satisfy one or more of a plurality of combinations of said conditions.
Claim 21
Independent Claim
104 words
A method for evaluating an expression comprising conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said method comprising storing information that identifies data elements having values which satisfy one or more of said conditions represented by at least some of said nodes; and testing said stored information by applying said expression to said stored information to determine whether a combination of data elements presented to the network have values that satisfy one or more of a plurality of combinations of said conditions.
Claim 22
Dependent Claim
44 words
The method of claim 18 wherein said information is stored in separate locations assigned to said information from different ones of said some nodes, and further comprising entering said information from each one of said some nodes into the location assigned to said node.
Claim 23
Dependent Claim
52 words
The method of claim 19 adapted for use wherein said expression is satisfied if a predetermined number of said conditions in said expression have been satisfied, and said testing includes counting the number of locations that are occupied with said information to determine how many conditions in said expression have been satisfied.
Claim 24
Dependent Claim
55 words
The method of claim 19 wherein said expression includes an indexing condition represented by a node, and further comprising establishing groups of said locations in said storage based on information from said indexing condition node, each one of said groups being associated with one or more of said data elements that satisfy said indexing condition.
Claim 25
Independent Claim
217 words
A method for evaluating an expression comprising conditions, the evaluating being based on whether a combination of data elements presented to a network have values that satisfy a combination of said conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said expression including an indexing condition represented by a node, said method comprising storing information that identifies data elements that have values which satisfy one or more of said conditions represented by at least some of said nodes and identifies data elements that satisfy said indexing condition, said information being stored in separate locations assigned to said information from different ones of said some nodes, entering said information from each one of said some nodes into the location assigned to said node, establishing groups of said locations in said storage based on information from said indexing condition node, each one of said groups being associated with one or more of said data elements that satisfy said indexing condition, said information from said some nodes being entered in the locations of the group that corresponds to said identified data elements, and testing said stored information in accordance with said expression as a basis for evaluating said expression.
Claim 26
Independent Claim
217 words
A method for evaluating an expression comprising conditions, the evaluating being based on whether a combination of data elements presented to a network have values that satisfy a combination of said conditions, the network being of a kind in which said conditions are represented by nodes and the relationships among conditions in said expression are represented by links among said nodes, said expression including an indexing condition represented by a node, said method comprising storing information that identifies data elements that have values which satisfy one or more of said conditions represented by at least some of said nodes and identifies data elements that satisfy said indexing condition, said information being stored in separate locations assigned to said information from different ones of said some nodes, entering said information from each one of said some nodes into the location assigned to said node, establishing groups of said locations in said storage based on information from said indexing condition node, each one of said groups being associated with one or more of said data elements that satisfy said indexing condition, said information from said some nodes being entered in the locations of the group that corresponds to said identified data elements, and testing said stored information in accordance with said expression as a basis for evaluating said expression.
Claim 27
Dependent Claim
49 words
The method of claim 22 wherein said expression is satisfied if a predetermined number of said conditions in said expression have been satisfied, and said testing includes counting the number of said locations in each group that are occupied with said information to determine whether said expression is satisfied.
Claim 28
Dependent Claim
26 words
The method of claim 23 wherein said testing monitors whether each said group currently has a count of occupied locations that indicates satisfaction of said expression.
Claim 29
Dependent Claim
28 words
The method of claim 24 wherein said testing counts said occupied locations in a group each time a new entry of said information is made in said group.
Claim 30
Dependent Claim
54 words
The method of claim 25 further comprising producing an indication that said expression is satisfied if a new entry of said information causes a group that did not previously have a count of occupied locations that indicated satisfaction of said expression to have a count of occupied locations that indicates satisfaction of said expression.
Claim 31
Dependent Claim
41 words
The method of claim 26 further comprising refraining from producing said indication if said group already had a count of occupied locations that satisfied said expression at the time that said new entry of said information is made into said group.
Claim 32
Dependent Claim
49 words
The method of claim 23 wherein said some nodes are adapted to cause said information to be deleted from corresponding occupied said locations in said storage, and said testing includes counting the occupied locations in a group each time said information is deleted from a location in said group.
Claim 33
Dependent Claim
50 words
The method of claim 28 further comprising producing an indication that said expression is not satisfied if a deletion of said information causes a group that previously had a count of occupied locations that satisfied said expression to have a count of occupied locations that does not satisfy said expression.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-06-10 | 1994-12-10 | 1995-06-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-06-10 | 1998-12-10 | 1999-06-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-06-10 | 2002-12-10 | 2003-06-11 | $7700.00 | Window Closed / Lapsed |