发明名称 Minimum cardinality candidate generation
摘要 This NGDE algorithm incorporates a minimum cardinality candidate diagnosis generator which exploits conflict set reduction rules to dramatically reduce the search space and thus reduce the computational resources required to find minimum cardinality diagnoses.
申请公布号 US9563525(B2) 申请公布日期 2017.02.07
申请号 US201012781269 申请日期 2010.05.17
申请人 Palo Alto Research Center Incorporated 发明人 de Kleer Johan
分类号 G06F17/00;G06N5/02;G06F11/22;G06N5/00 主分类号 G06F17/00
代理机构 Fay Sharpe LLP 代理人 Fay Sharpe LLP
主权项 1. A method for performing diagnoses in a modeled system, the method comprising: searching for output information from components of the modeled system; searching for conflicts among the output information of the modeled system being searched; discovering conflicts among the output information; forming a conflict set from the discovered conflicts; transforming the conflict set into a simplified conflict set, the transforming including repeatedly: (i) removing subsumed conflicts in the conflict set by subsumption;(ii) factoring the set of conflicts into disconnected subgraphs;(iii) further, removing a component x from all conflicts and note the equivalences if the component x≡a component y, wherein the component x≡the component y if conf(x)=conf(y), and wherein conf returns a set of conflicts in which a given component appears, and wherein the noted equivalences are not used to generate additional equivalent diagnoses; and(iv) further, removing the component x from all conflicts if the component x<the component y, wherein the component x<the component y if conf(x)conf (y), searching for a diagnosis of the modeled system using the simplified conflict set; obtaining the diagnosis using the simplified conflict set, wherein the obtaining focuses on obtaining a minimum cardinality diagnosis; and wherein the method is performed by at least one electronic processor and output to an output device for at least one of display and printing.
地址 Palo Alto CA US