Patent US4761746A successfully refreshed from Google Patents.
US4761746A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Dynamic reconstruction method for discrimination network
Assignee: Hitachi Ltd
•
Filing: 1986-08-19
•
Granted: 1988-08-02
•
Expires: 2006-08-19
Abstract
Abstract A dynamic network reconstruction method in which the node processing information such as a node processing volume and a ratio at which a node is satisfied is collected for all nodes to maintain an efficient network even when the characteristic of an object described in a condition clause is changed in a Rete network of a production system using the knowledge technology and the network is changed based on the node processing information.
Inventors
- 👤 Shunichi Tano
- 👤 Motohisa Funabashi
- 👤 Shoichi Masui
- 👤 Seiji Sakaguchi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 04:24
CPC Classifications
G; G06; G06N; G06N5/00; G06N5/04; G06N5/046; G06N5/047; Y; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/911; Y10S706/914
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
101 words
A method for dynamically reconstructing a network in a system in which a determination of whether or not a composite condition for an object data including a data name and at least a pair of an attribute name and an attribute value is satisfied based on network nodes representing clauses of the composite condition, said network nodes being sequentially processed beginning with a node corresponding to the highest position in the network, comprising the steps of: collecting node processing information when said composite condition is determined to be satisfied; and dynamically reconstructing the network basded on the collected node processing information.
Claim 2
Independent Claim
101 words
A method for dynamically reconstructing a network in a system in which a determination of whether or not a composite condition for an object data including a data name and at least a pair of an attribute name and an attribute value is satisfied based on network nodes representing clauses of the composite condition, said network nodes being sequentially processed beginning with a node corresponding to the highest position in the network, comprising the steps of: collecting node processing information when said composite condition is determined to be satisfied; and dynamically reconstructing the network basded on the collected node processing information.
Claim 3
Dependent Claim
30 words
A method according to claim 1, wherein said step of dynamically reconstructing the network includes a step of referencing a table which represents favorableness for hierarchic relationships between the nodes.
Claim 4
Dependent Claim
37 words
A method according to claim 1 wherein said node processing information includes information related to a processing volume of each node and information related to a ratio at which a condition described in each node is satisfied.
References Cited (Backward Citations)
US4286330A
Cited
US4628435A
Cited
US4599693A
Cited
US4599692A
Cited
US4649515A
Cited
US4670848A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-08-02 | 1992-02-01 | 1992-08-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-08-02 | 1996-02-01 | 1996-08-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-08-02 | 2000-02-01 | 2000-08-02 | $7700.00 | Window Closed / Lapsed |