Name
Abstract | ||
|---|---|---|
Rule base refinement plays an important role in enhancing the efficacy and efficiency of utilizing a rule base. A rule base concerns three types of redundancies: implication-rule redundancy, abstraction-rule redundancy and dead-end-condition redundancy. This paper proposes two approaches: one is to remove implication redundant rules by using the closure of literal set and the other is to remove abstraction redundant rules by using rule-abstraction. We have developed a software tool to support the first approach. Experiments show that the tool can work correctly and efficiently. The proposed approach can be applied to more application fields. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/3-540-45034-3_19 | IEA/AIE |
Keywords | Field | DocType |
software tool,rule base,implication redundant rule,abstraction redundant rule,abstraction-rule redundancy,implication-rule redundancy,dead-end-condition redundancy,rule base refinement,rule base concern,rule based | Software tool,Abstraction,Computer science,Expert system,Algorithm,Redundancy (engineering),Algorithm theory,Artificial intelligence,Knowledge base | Conference |
Volume | ISSN | ISBN |
2718 | 0302-9743 | 3-540-40455-4 |
Citations | PageRank | References |
6 | 0.65 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hai Zhuge | 1 | 2155 | 159.14 |
| Yunchuan Sun | 2 | 534 | 54.06 |
| Weiyu Guo | 3 | 37 | 3.58 |