visualizing inference process of a rule engine
Shi Jian; Qiao Ying; Wang Hongan
2011
会议名称4th Visual Information Communication - International Symposium, VINCI 2011
会议录名称ACM International Conference Proceeding Series
页码-
会议日期August 4,
会议地点Hong Kong, China
收录类别EI
出版地United States
ISBN9781450308755
部门归属(1) Institute of Software, Chinese Academy of Sciences, Beijing, China
摘要In this paper, we introduce an approach to visualize the inference process in a rule engine - Drools, which employs Rete as its pattern matching algorithm. As a software visualization work, our approach is focused on both static structure of the Rete network and dynamic behavior of the inference process. Since logic programming is distinct from other traditional programming paradigms, our approach is also different from traditional program/algorithm visualization methods. In this paper, we first introduce the target we choose to visualize, and then provide a description of the problem and our visualization approach. Finally, with an implementation and an interesting case - sudoku solving, we show that the visualization work is helpful to understanding not only the Rete algorithm, but also the rules used in the inference. Besides, our work supports debugging, tracing and analyzing the rule engine, which is useful in finding errors and optimization. © 2011 ACM.
关键词Algorithms Java Programming Language Logic Programming Pattern Matching Visual Communication Visualization
主办者ACM SIGCHI China; China Computer Federation
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/14201
专题人机交互技术与智能信息处理实验室
推荐引用方式
GB/T 7714
Shi Jian,Qiao Ying,Wang Hongan. visualizing inference process of a rule engine[C]. United States,2011:-.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
visualizing inferenc(407KB) 开放获取--请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Shi Jian]的文章
[Qiao Ying]的文章
[Wang Hongan]的文章
百度学术
百度学术中相似的文章
[Shi Jian]的文章
[Qiao Ying]的文章
[Wang Hongan]的文章
必应学术
必应学术中相似的文章
[Shi Jian]的文章
[Qiao Ying]的文章
[Wang Hongan]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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