摘要
因果图的经典推理算法是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.
出处
《计算机工程与应用》
CSCD
北大核心
2015年第18期229-232,共4页
Computer Engineering and Applications
基金
国家社科基金(No.13BTJ008)
重庆师范大学研究生科研创新项目(No.YKC14007)
关键词
因果图
二元决策图
割集
不交化割集
causality diagram
binary decision diagram
cut sets
disjoint cut sets
