摘要
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.
原文 | English |
---|---|
頁面 | 63-66 |
頁數 | 4 |
出版狀態 | Published - 1989 12月 1 |
事件 | 4th IEEE Region 10th International Conference - TENCON '89 - Bombay, India 持續時間: 1989 11月 22 → 1989 11月 24 |
Other
Other | 4th IEEE Region 10th International Conference - TENCON '89 |
---|---|
城市 | Bombay, India |
期間 | 89-11-22 → 89-11-24 |
All Science Journal Classification (ASJC) codes
- 一般工程