资源分类
》 资源 》论文》Belief Base Rationalization for Propositional Merging ? Se?bastien Konieczny Pierre Marquis Nicolas Schwind

Belief Base Rationalization for Propositional Merging ? Se?bastien Konieczny Pierre Marquis Nicolas Schwind

2019-11-12 | |  46 |   45 |   0
Abstract Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraints. In this paper, we show that this is not suited to every merging scenario. We study the case when the bases are ”rationalized” with respect to the integrity constraints during the merging process. We de?ne in formal terms several independence conditions for merging operators and show how they interact with the standard IC postulates for belief merging. Especially, we give an independence-based axiomatic characterization of a distance-based operator.

上一篇：A Logic for Causal Inference in Time Series with Discrete and Continuous Variables

下一篇：On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...