On probabilistic inference in relational conditional logics

On probabilistic inference in relational conditional logics
复制标题

关系条件逻辑中的概率推理

DOI:
10.1093/jigpal/jzs010
复制
发表时间:
2012
期刊:
Log. J. IGPL
影响因子:
--
通讯作者:
G. Kern-Isberner
G. Kern-Isberner
中科院分区:
--
文献类型:
--
作者:
G. Kern-Isberner

文献摘要

参考文献

被引文献

相似文献

最大熵原理已被证明是命题语言上概率条件逻辑常识推理的一种强有力的方法。由于这一原则,推理是基于具有最大熵的知识库的唯一模型来执行的。这种基于模型的推理满足归纳推理机制的许多理想属性,并且通常是从信息论的角度进行推理的最佳选择。然而,概率推理的命题形式主义的表达能力是有限的,在过去的几年中,许多建议已经给出了概率推理的关系设置。人们普遍认为,为了解释概率一阶句,要么必须使用统计方法来计算个体(元组),要么必须建立知识库以使可能世界的语义适用于概率的主观解释。大多数第二类的建议依赖于传统的概率模型,如贝叶斯网或马尔可夫网络的扩展,而只有很少的工作概率条件逻辑的一阶扩展。在这里,我们采取的方法,提升最大熵方法的关系的情况下,采用概率条件逻辑的关系版本。首先,我们提出了两种不同的语义和模型理论解释一阶概率条件逻辑。我们解决了主观和统计观点之间的差异所引起的模糊性问题,并开发了一个全面的列表,在关系框架中基于归纳模型的概率推理的理想属性。最后,通过在两种不同的语义框架中应用最大熵原理,我们得到了满足这些性质的推理算子,并证明它们是一阶概率条件逻辑推理的合理选择。
The principle of maximum entropy has proven to be a powerful approach for commonsense reasoning in probabilistic conditional logics on propositional languages. Due to this principle, reasoning is performed based on the unique model of a knowledge base that has maximum entropy. This kind of model-based inference fulfils many desirable properties for inductive inference mechanisms and is usually the best choice for reasoning from an information theoretical point of view. However, the expressive power of propositional formalisms for probabilistic reasoning is limited and in the past few years many proposals have been given for probabilistic reasoning in relational settings. It seems to be a common view that in order to interpret probabilistic first-order sentences, either a statistical approach that counts (tuples of) individuals has to be used, or the knowledge base has to be grounded to make a possible worlds semantics applicable, for a subjective interpretation of probabilities. Most of these proposals of the second type rely on extensions of traditional probabilistic models like Bayes nets or Markov networks whereas there are only few works on first-order extensions of probabilistic conditional logic. Here, we take an approach of lifting maximum entropy methods to the relational case by employing a relational version of probabilistic conditional logic. First, we propose two different semantics and model theories for interpreting first-order probabilistic conditional logic. We address the problems of ambiguity that are raised by the difference between subjective and statistical views, and develop a comprehensive list of desirable properties for inductive model-based probabilistic inference in relational frameworks. Finally, by applying the principle of maximum entropy in the two different semantical frameworks, we obtain inference operators that fulfill these properties and turn out to be reasonable choices for reasoning in first-order probabilistic conditional logic.
DOI: --
发表时间: 1997
影响因子: 3.9
作者:
J. Paris;A. Vencovská
通讯作者: A. Vencovská
使用概率条件逻辑进行学习和建模
DOI: --
发表时间: 2010
期刊: DISKI
影响因子: --
作者:
J. Fisseler
通讯作者: J. Fisseler
DOI: 10.1007/978-3-540-78652-8
发表时间: 2008
期刊: --
影响因子: --
作者:
通讯作者: --
DOI: 10.1093/jigpal/jzs009
发表时间: 2012-10
期刊: Log. J. IGPL
影响因子: --
作者:
Marc Finthammer;Matthias Thimm
通讯作者: Marc Finthammer;Matthias Thimm
DOI: --
发表时间: 2009
期刊:
影响因子: --
作者:
Matthias Thimm
通讯作者: Matthias Thimm