Historical Rete networks for debugging rule-based systems

Sharon M. Tuttle, C. Eick
{"title":"Historical Rete networks for debugging rule-based systems","authors":"Sharon M. Tuttle, C. Eick","doi":"10.1109/TAI.1991.167127","DOIUrl":null,"url":null,"abstract":"To debug a forward-chaining rule-based program, certain, historical, information is needed. System builders should be able to request such information directly, instead of having to rerun the program one step at a time or search a trace of run details. As a first step in designing an explanation system for answering such questions, a proposal is discussed for storing a forward-chaining program run's 'historical' details in its Rete inference network, used to match rule conditions to working memory, without seriously affecting the network's run-time performance. This proposed modified Rete network is called a historical Rete network. Various algorithms for maintaining this network are discussed, along with how it can be used to analyze what happened during a program run.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1991.167127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

To debug a forward-chaining rule-based program, certain, historical, information is needed. System builders should be able to request such information directly, instead of having to rerun the program one step at a time or search a trace of run details. As a first step in designing an explanation system for answering such questions, a proposal is discussed for storing a forward-chaining program run's 'historical' details in its Rete inference network, used to match rule conditions to working memory, without seriously affecting the network's run-time performance. This proposed modified Rete network is called a historical Rete network. Various algorithms for maintaining this network are discussed, along with how it can be used to analyze what happened during a program run.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于调试基于规则的系统的历史远程网络
要调试基于前向链规则的程序,需要一定的历史信息。系统构建者应该能够直接请求这些信息,而不是一次一步地重新运行程序或搜索运行详细信息的跟踪。作为设计解释系统来回答这些问题的第一步,我们讨论了将前向链程序运行的“历史”细节存储在其Rete推理网络中的建议,用于将规则条件与工作记忆相匹配,而不会严重影响网络的运行时性能。这种改进的Rete网络被称为历史Rete网络。讨论了维护该网络的各种算法,以及如何使用它来分析程序运行期间发生的事情。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AUTOTEC: an English to Chinese machine translation system Backward assembly planning An event-based real-time logic to specify the behavior and timing properties of real-time systems Feature-based design evaluation through constraint structure unification Extending the learnability of decision trees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1