Credibility-Limited Revision Operators in Propositional Logic
Credibility-Limited Revision Operators in Propositional Logic
复制标题
命题逻辑中的可信度有限修正算子
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
R. Pérez
中科院分区：
文献类型：
--
作者：
R. Booth;E. Fermé;S. Konieczny;R. Pérez
在信念修正中，新的信息被普遍接受，遵循更新优先的原则。在某些情况下，这种行为可能会受到批评，并且可以要求代理可以拒绝某些新的信息，例如，由于不充分的可扩展性。这就产生了几种非优先信念修正的方法。特别是（Hansson et al. 2001）定义了可信度有限的修正算子，只有当新信息是属于一组可信公式的公式时，修正才被接受。他们在AGM风格中提供了几个表示定理。在这项工作中，我们研究的信息表示在命题逻辑，如在胜野和Mendelzon的框架时，可靠性有限的修订运营商。我们提出了一套假设和表示定理的可行性有限的修订运营商。然后，我们将探讨如何将这些定义推广到迭代信念修正的情况下，使用Darwiche和Pearl风格的认知状态。
In Belief Revision the new information is generally accepted, following the principle of primacy of update. In some case this behavior can be criticized and one could require that some new pieces of information can be rejected by the agent because, for instance, of insufficient plausibility. This has given rise to several approaches of non-prioritized Belief Revision. In particular (Hansson et al. 2001) defined credibility-limited revision operators, where a revision is accepted only if the new information is a formula that belongs to a set of credible formulas. They provide several representation theorems in the AGM style. In this work we study credibility-limited revision operators when the information is represented in propositional logic, like in the Katsuno and Mendelzon framework. We propose a set of postulates and a representation theorem for credibility-limited revision operators. Then we explore how to generalize these definitions to the Iterated Belief Revision case, using epistemic states in the Darwiche and Pearl style.
DOI：
10.1016/j.ijar.2011.05.004
发表时间：
2011-10
期刊：
Int. J. Approx. Reason.
影响因子：
--
作者：
Jianbing Ma;Weiru Liu
通讯作者：
Jianbing Ma;Weiru Liu