可能性制约与传播
Possibilistic Conditioning and Propagation
摘要：
从Gardenfors和Makinson的基于期望的推理的角度，我们给出了一个公知的条件化方案--信任转移的公理化。然后，我们使用信念独立的概念来“过滤”不同的可能性条件规则的建议，所有的变化的信心转移。在我们考虑的三个规则中，只有Dempster的条件反射规则通过了支持信念独立性概念的测试。使用这个条件规则，然后，我们表明，我们可以使用本地计算所需的条件边际可能性的联合可能性满足给定的约束条件。事实证明，我们的本地计算方案已经由Shenoy提出。然而，我们的直觉与谢诺伊的直觉完全不同。虽然Shenoy只是定义了一个适合他的基于赋值系统框架的局部计算方案，但我们从II（，8）= tI（，8 I a）* II（a）和适当的独立性假设推导出该局部计算方案，就像贝叶斯推导出他们的局部计算方案一样。
英文摘要：
We give an axiomatization of confidence transfer - a known conditioning scheme - from the perspective of expectation-based inference in the sense of Gardenfors and Makinson. Then, we use the notion of belief independence to "filter out" different proposal s of possibilistic conditioning rules, all are variations of confidence transfer. Among the three rules that we consider, only Dempster's rule of conditioning passes the test of supporting the notion of belief independence. With the use of this conditioning rule, we then show that we can use local computation for computing desired conditional marginal possibilities of the joint possibility satisfying the given constraints. It turns out that our local computation scheme is already proposed by Shenoy. However, our intuitions are completely different from that of Shenoy. While Shenoy just defines a local computation scheme that fits his framework of valuation-based systems, we derive that local computation scheme from II(,8) = tI(,8 I a) * II(a) and appropriate independence assumptions, just like how the Bayesians derive their local computation scheme.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
