计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2015年
18期
229-232
,共4页
因果图%二元决策图%割集%不交化割集
因果圖%二元決策圖%割集%不交化割集
인과도%이원결책도%할집%불교화할집
causality diagram%binary decision diagram%cut sets%disjoint cut sets
因果图的经典推理算法是NP难的,因此需要寻找高效的推理算法。对二元决策图进行改进,并提出一种因果图向改进的二元决策图转换的方法。利用改进的二元决策图推理省略了割集不交化的过程,得到不交化割集,减小推理复杂度。
因果圖的經典推理算法是NP難的,因此需要尋找高效的推理算法。對二元決策圖進行改進,併提齣一種因果圖嚮改進的二元決策圖轉換的方法。利用改進的二元決策圖推理省略瞭割集不交化的過程,得到不交化割集,減小推理複雜度。
인과도적경전추리산법시NP난적,인차수요심조고효적추리산법。대이원결책도진행개진,병제출일충인과도향개진적이원결책도전환적방법。이용개진적이원결책도추리성략료할집불교화적과정,득도불교화할집,감소추리복잡도。
As the accurate reasoning algorithm of causality diagram is NP hard, it’s worth proposing an efficient reasoning method. This paper improves the binary decision diagram and proposes a method that transforms causality diagram into binary decision diagram, avoiding the process of disjoint cut sets. It can effectively reduce the reasoning complexity.