Theory and algorithm for rule base refinement

Authors:
Hai Zhuge;Yunchuan Sun;Weiyu Guo
Affiliations:
Knowledge Grid Research Group, Key Lab of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Science, Beijing, China;Department of Computer Science, College of Information Science, Beijing Normal University, Beijing, China;Knowledge Grid Research Group, Key Lab of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Science, Beijing, China
Venue:
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Year:
2003

Citing 7
Cited 2

Knowledge base verification

AI Magazine
A decision-table-used processor for checking completeness and consistency in rule-based expert systems

International Journal of Man-Machine Studies
Integrated knowledge-based system design and validation for solving problems in uncertain environments

International Journal of Man-Machine Studies - Special issue: symbolic problem solving in noisy and novel task environments
Inheritance rules for flexible model retrieval

Decision Support Systems
Mining Generalized Association Rules

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Checking an expert systems knowledge base for consistency and completeness

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Active document framework ADF: concept and method

APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications

A general knowledge mediation infrastructure for multi-agent systems

Expert Systems with Applications: An International Journal
Semantic spam filtering from personalized ontologies

Journal of Web Engineering

Quantified Score

Hi-index	0.00

Visualization

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.