Contraction in propositional logic
Contraction in propositional logic
复制标题
命题逻辑中的收缩
DOI：
10.1016/j.ijar.2016.06.010
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
P. Marquis
中科院分区：
文献类型：
--
作者：
Thomas Caridroit;S. Konieczny;P. Marquis
信念集修正和收缩的AGM模型为两类改变算子中的每一族提供了合理性假设。在有限命题逻辑的背景下，Katsuno和Mendelzon指出了信念基础修订的假设，这些假设对应于信念集修订的AGM假设。在这篇文章中，我们给出了命题信任基的收缩公设，它对应于信念集的AGM收缩公设。由于利维和哈珀的身份，我们强调了在Katsuno和Mendelzon意义上与信仰基础修订的现有联系。我们还给出了命题信任基的压缩算子的表示定理。
The AGM model for the revision and contraction of belief sets provides rationality postulates for each of the two families of change operators. In the context of finite propositional logic, Katsuno and Mendelzon pointed out postulates for the revision of belief bases which correspond to the AGM postulates for the revision of beliefs sets. In this paper, we present postulates for the contraction of propositional belief bases which correspond to the AGM postulates for the contraction of belief sets. We highlight the existing connections with the revision of belief bases in the sense of Katsuno and Mendelzon thanks to Levi and Harper identities. We also present a representation theorem for contraction operators for propositional belief bases.