CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
Theory and algorithm for rule base refinement
Zhuge, H; Sun, YC; Guo, WY
2003
发表期刊DEVELOPMENTS IN APPLIED ARTIFICIAL INTELLIGENCE
ISSN0302-9743
卷号2718页码:187-196
摘要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.
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Artificial Intelligence
WOS记录号WOS:000184852400019
出版者SPRINGER-VERLAG BERLIN
引用统计
被引频次:1[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/13614
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhuge, H
作者单位1.Chinese Acad Sci, Comp Technol Inst, Key Lab Intelligent Informat Proc, Knowledge Grid Res Grp, Beijing 100080, Peoples R China
2.Beijing Normal Univ, Dept Comp Sci, Coll Informat Sci, Beijing 100875, Peoples R China
推荐引用方式
GB/T 7714
Zhuge, H,Sun, YC,Guo, WY. Theory and algorithm for rule base refinement[J]. DEVELOPMENTS IN APPLIED ARTIFICIAL INTELLIGENCE,2003,2718:187-196.
APA Zhuge, H,Sun, YC,&Guo, WY.(2003).Theory and algorithm for rule base refinement.DEVELOPMENTS IN APPLIED ARTIFICIAL INTELLIGENCE,2718,187-196.
MLA Zhuge, H,et al."Theory and algorithm for rule base refinement".DEVELOPMENTS IN APPLIED ARTIFICIAL INTELLIGENCE 2718(2003):187-196.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhuge, H]的文章
[Sun, YC]的文章
[Guo, WY]的文章
百度学术
百度学术中相似的文章
[Zhuge, H]的文章
[Sun, YC]的文章
[Guo, WY]的文章
必应学术
必应学术中相似的文章
[Zhuge, H]的文章
[Sun, YC]的文章
[Guo, WY]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。