首页> 外文期刊>Journal of logic and computation >Belief base rationalization for propositional merging
【24h】

Belief base rationalization for propositional merging

机译:命题合并的信念基础合理化

获取原文
获取原文并翻译 | 示例
           

摘要

Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraint. In this paper, we argue that this is not suited to every merging scenario, especially when the integrity constraint encodes physical laws. In that case the bases have to be 'rationalized' with respect to the integrity constraint during the merging process. We define several conditions characterizing the operators that are independent to such a rationalization process, and we show how these conditions interact with the standard IC postulates for belief merging. Especially, we give an independence-based axiomatic characterization of a distance-based operator.
机译:现有的信仰合并运营商可以利用所有基础模型,包括与完整性约束相矛盾的模型。在本文中,我们认为这不适用于每种合并方案,尤其是当完整性约束对物理定律进行编码时。在这种情况下,必须在合并过程中相对于完整性约束对基础进行“合理化”。我们定义了几个条件来表征独立于这种合理化过程的运算符,并且我们展示了这些条件如何与用于信念合并的标准IC假设相互作用。特别是,我们给出了基于距离的算子的基于独立性的公理化特征。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号