一种改进的临界诊断推理方法

Yue Xu, Chengqi Zhang
{"title":"一种改进的临界诊断推理方法","authors":"Yue Xu, Chengqi Zhang","doi":"10.1109/TAI.1996.560448","DOIUrl":null,"url":null,"abstract":"Model-based diagnosis has the disadvantage of a high computational complexity. One way to overcome this disadvantage is to focus the diagnosis on a reduced diagnostic space. We propose an improved critical diagnosis reasoning method based on the method proposed by (Raiman et al., 1993). The method focuses the diagnosis on finding out the kernel diagnoses instead of the whole diagnoses. We give an updated definition of critical cover which we call \"critical partition\". The conditions satisfied by critical partition are relaxed compared with the conditions for critical cover. Correspondingly, a non-backtracking algorithm called Searching Critical Partition (SCP) to find out the critical partition is also proposed.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An improved critical diagnosis reasoning method\",\"authors\":\"Yue Xu, Chengqi Zhang\",\"doi\":\"10.1109/TAI.1996.560448\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Model-based diagnosis has the disadvantage of a high computational complexity. One way to overcome this disadvantage is to focus the diagnosis on a reduced diagnostic space. We propose an improved critical diagnosis reasoning method based on the method proposed by (Raiman et al., 1993). The method focuses the diagnosis on finding out the kernel diagnoses instead of the whole diagnoses. We give an updated definition of critical cover which we call \\\"critical partition\\\". The conditions satisfied by critical partition are relaxed compared with the conditions for critical cover. Correspondingly, a non-backtracking algorithm called Searching Critical Partition (SCP) to find out the critical partition is also proposed.\",\"PeriodicalId\":209171,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1996.560448\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560448","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

基于模型的诊断具有计算复杂度高的缺点。克服这一缺点的一种方法是将诊断集中在缩小的诊断空间上。我们在(Raiman et al., 1993)方法的基础上提出了一种改进的关键诊断推理方法。该方法的诊断重点是找出核心诊断,而不是全部诊断。我们给出了临界覆盖的更新定义,我们称之为“临界分区”。与临界覆盖条件相比,临界分区条件放宽。相应的,提出了一种非回溯算法——关键分区搜索算法(SCP)来查找关键分区。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved critical diagnosis reasoning method
Model-based diagnosis has the disadvantage of a high computational complexity. One way to overcome this disadvantage is to focus the diagnosis on a reduced diagnostic space. We propose an improved critical diagnosis reasoning method based on the method proposed by (Raiman et al., 1993). The method focuses the diagnosis on finding out the kernel diagnoses instead of the whole diagnoses. We give an updated definition of critical cover which we call "critical partition". The conditions satisfied by critical partition are relaxed compared with the conditions for critical cover. Correspondingly, a non-backtracking algorithm called Searching Critical Partition (SCP) to find out the critical partition is also proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs A deliberative and reactive diagnosis agent based on logic programming Subdefinite models as a variety of constraint programming Oz Scheduler: a workbench for scheduling problems Automatic scale selection as a pre-processing stage to interpreting real-world data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1