Abstract
A rule-based knowledge system (RBKS) clipping scheme is proposed which contains three heuristic algorithms to find circular rules, redundant rules, and conflicting rules. First, the authors create AND/OR graphs to construct the dependent-on relations among the literals in an RBKS. Then they manipulate an AND/OR graph as an ordinary digraph to get a reachability matrix. Finally, the authors use heuristic search strategy, guided by the information implied in the reachability matrix, to find the circular rules, redundant rules, or conflicting rules.
Original language | English |
---|---|
Pages | 63-66 |
Number of pages | 4 |
Publication status | Published - 1989 Dec 1 |
Event | 4th IEEE Region 10th International Conference - TENCON '89 - Bombay, India Duration: 1989 Nov 22 → 1989 Nov 24 |
Other
Other | 4th IEEE Region 10th International Conference - TENCON '89 |
---|---|
City | Bombay, India |
Period | 89-11-22 → 89-11-24 |
All Science Journal Classification (ASJC) codes
- General Engineering