Patent US4928236A successfully refreshed from Google Patents.
US4928236A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Display method in an inference trace of an expert system
Assignee: Sharp Corp
•
Filing: 1988-07-19
•
Granted: 1990-05-22
•
Expires: 2008-07-19
Abstract
Abstract An expert system having a forward inference control method in which an inference process (hereinafter referred to as trace) is displayed in consideration of the condition of a negation when the trace is displayed to verify a rule inputted to the expert system, whereby, a user can confirm that a rule is unexecutable because of the condition of the negation being not satisfied.
Inventors
- 👤 Toshiyuki Tanaka
- 👤 Shigeki Kuga
- 👤 Nobuo Nakamura
- 👤 Taro Morishita
- 👤 Masahiro Wada
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 20:13
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/22; G06F11/2257; G06F11/30; G06F11/32; G06F11/321
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
80 words
A method for displaying a trace of a rule for forward inference control in an expert system comprising the steps of: (a) displaying information indicating an addition of a fact to the working memory; (b) determining the condition of a match between the rule and the added fact; (c) determining if condition of negation is satisfied if the condition in step (b) is affirmative; (d) displaying information indicating that the rule is executable if the condition of negation is satisfied.
Claim 2
Independent Claim
80 words
A method for displaying a trace of a rule for forward inference control in an expert system comprising the steps of: (a) displaying information indicating an addition of a fact to the working memory; (b) determining the condition of a match between the rule and the added fact; (c) determining if condition of negation is satisfied if the condition in step (b) is affirmative; (d) displaying information indicating that the rule is executable if the condition of negation is satisfied.
Claim 3
Dependent Claim
36 words
A method as claimed in claim 1, further comprising the step of: (e) displaying information indicating an unexecutable rule due to the condition of negation not being satisfied if the condition of negation is not satisfied.
Claim 4
Dependent Claim
53 words
A method as claimed in claim 1, further comprising the steps of: (f) determining if the condition of negation is satisfied if the condition in step (b) is negative; (g) displaying information indicating a change in the status of a rule from executable to unexecutable if the condition of negation is not satisfied.
Claim 5
Independent Claim
88 words
A method for displaying a trace of a rule for forward inference control in an expert system comprising the steps of: (a) displaying information indicating a deletion of a fact to the working memory; (b) determining the condition of a match between the rule and the deleted fact; (c) determining if a condition of negation is satisfied if the condition in step (b) is negative; (d) displaying information indicating a change in the status of a rule from unexecutable to executable if the condition of negation is satisfied.
Claim 6
Independent Claim
88 words
A method for displaying a trace of a rule for forward inference control in an expert system comprising the steps of: (a) displaying information indicating a deletion of a fact to the working memory; (b) determining the condition of a match between the rule and the deleted fact; (c) determining if a condition of negation is satisfied if the condition in step (b) is negative; (d) displaying information indicating a change in the status of a rule from unexecutable to executable if the condition of negation is satisfied.
Claim 7
Dependent Claim
48 words
A method as claimed in claim 4, further comprising the steps of: (e) determining if the deleted fact has been used if the condition in step (b) is affirmative; (f) displaying information indicating the deletion of an executable or unexecutable rule if the detected fact has been used.
Claim 8
Independent Claim
71 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) adding a fact to a working memory; (2) determining the condition of a match between the rule and the added fact; (3) determining if a condition of negation is satisfied if the condition in step (2) is affirmative; and (b) displaying information indicating that the rule is executable if the condition of negation is satisfied.
Claim 9
Independent Claim
71 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) adding a fact to a working memory; (2) determining the condition of a match between the rule and the added fact; (3) determining if a condition of negation is satisfied if the condition in step (2) is affirmative; and (b) displaying information indicating that the rule is executable if the condition of negation is satisfied.
Claim 10
Dependent Claim
36 words
A method as claimed in claim 6, further comprising the step of: (c) displaying information indicating an unexecutable rule due to the condition of negation not being satisfied if the condition of negation is not satisfied.
Claim 11
Independent Claim
78 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) adding a fact to a working memory; (2) determining the condition of a match between the rule and the added fact; (3) determining if the condition of negation is satisfied if the condition in step (2) is negative; and (b) displaying information indicating a change in status of a rule from executable to unexecutable if the condition of negation is not satisfied.
Claim 12
Independent Claim
78 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) adding a fact to a working memory; (2) determining the condition of a match between the rule and the added fact; (3) determining if the condition of negation is satisfied if the condition in step (2) is negative; and (b) displaying information indicating a change in status of a rule from executable to unexecutable if the condition of negation is not satisfied.
Claim 13
Independent Claim
78 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) deleting a fact from a working memory; (2) determining the condition of a match between the rule and the deleted fact; (3) determining if a condition of negation is satisfied if the condition in step (2) is negative; and (b) displaying information indicating a change in the status of a rule from unexecutable to executable if the condition of negation is satisfied.
Claim 14
Independent Claim
78 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) deleting a fact from a working memory; (2) determining the condition of a match between the rule and the deleted fact; (3) determining if a condition of negation is satisfied if the condition in step (2) is negative; and (b) displaying information indicating a change in the status of a rule from unexecutable to executable if the condition of negation is satisfied.
Claim 15
Independent Claim
57 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) changing the contents of a working memory by adding or deleting a fact; and (2) determining the executability of a rule in consideration of a condition negation; (b) displaying a trace of a rule in consideration of the condition of negation.
Claim 16
Independent Claim
57 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) changing the contents of a working memory by adding or deleting a fact; and (2) determining the executability of a rule in consideration of a condition negation; (b) displaying a trace of a rule in consideration of the condition of negation.
Claim 17
Independent Claim
82 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) changing the contents of a working memory by adding or deleting a fact; (2) determining if a condition of negation is satisfied; (3) determining a rule to be non-executable if the condition of negation is not satisfied; (b) displaying information indicating a non-executable rule as information indicating not satisfying a condition of negation so as to indicate to a user why such a rule is non-executable.
Claim 18
Independent Claim
82 words
A method of developing an expert system comprising the steps of: (a) tracing a rule; (1) changing the contents of a working memory by adding or deleting a fact; (2) determining if a condition of negation is satisfied; (3) determining a rule to be non-executable if the condition of negation is not satisfied; (b) displaying information indicating a non-executable rule as information indicating not satisfying a condition of negation so as to indicate to a user why such a rule is non-executable.
References Cited (Backward Citations)
US4752888A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-05-21 | 1993-11-20 | 1994-05-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-05-21 | 1997-11-20 | 1998-05-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-05-21 | 2001-11-20 | 2002-05-22 | $7700.00 | Window Closed / Lapsed |