对于多次迭代的信念改变,我们需要什么样的独立性?

Q1 Mathematics Journal of Applied Logic Pub Date : 2017-07-01 DOI:10.1016/j.jal.2016.11.033
Gabriele Kern-Isberner, Daniela Huvermann
{"title":"对于多次迭代的信念改变,我们需要什么样的独立性?","authors":"Gabriele Kern-Isberner,&nbsp;Daniela Huvermann","doi":"10.1016/j.jal.2016.11.033","DOIUrl":null,"url":null,"abstract":"<div><p>Multiple iterated revision requires advanced belief revision techniques that are able to integrate several pieces of new information into epistemic states. A crucial feature of this kind of revision is that the multiple pieces of information should be dealt with separately. Previous works have proposed several independence postulates which should ensure this. In this paper, we argue, first, that these postulates are too strong as they may enforce beliefs without justification, and second, that they are not necessary to ensure the principal aim of multiple revision. Instead, principles of conditional preservation guarantee a suitable handling of sets of sentences under revision. We formalize such a principle for multiple propositional revision for ranking functions, and we propose some novel postulates for multiple iterated revision that are in line with AGM and the Darwiche &amp; Pearl postulates. We show that just a few fundamental postulates are enough to cover major approaches to (multiple) iterated belief revision, and that independence in the sense of Thielscher, Jin, and Delgrande is optional. As a proof of concept, we present propositional c-revisions of ranking functions.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"22 ","pages":"Pages 91-119"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.11.033","citationCount":"10","resultStr":"{\"title\":\"What kind of independence do we need for multiple iterated belief change?\",\"authors\":\"Gabriele Kern-Isberner,&nbsp;Daniela Huvermann\",\"doi\":\"10.1016/j.jal.2016.11.033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Multiple iterated revision requires advanced belief revision techniques that are able to integrate several pieces of new information into epistemic states. A crucial feature of this kind of revision is that the multiple pieces of information should be dealt with separately. Previous works have proposed several independence postulates which should ensure this. In this paper, we argue, first, that these postulates are too strong as they may enforce beliefs without justification, and second, that they are not necessary to ensure the principal aim of multiple revision. Instead, principles of conditional preservation guarantee a suitable handling of sets of sentences under revision. We formalize such a principle for multiple propositional revision for ranking functions, and we propose some novel postulates for multiple iterated revision that are in line with AGM and the Darwiche &amp; Pearl postulates. We show that just a few fundamental postulates are enough to cover major approaches to (multiple) iterated belief revision, and that independence in the sense of Thielscher, Jin, and Delgrande is optional. As a proof of concept, we present propositional c-revisions of ranking functions.</p></div>\",\"PeriodicalId\":54881,\"journal\":{\"name\":\"Journal of Applied Logic\",\"volume\":\"22 \",\"pages\":\"Pages 91-119\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.jal.2016.11.033\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570868316300921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Logic","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570868316300921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 10

摘要

多次迭代修正需要先进的信念修正技术,能够将多个新信息整合到认知状态中。这种修订的一个关键特征是,应该分别处理多个信息片段。以前的工作已经提出了几个独立的假设,应该确保这一点。在本文中,我们认为,首先,这些假设过于强大,因为它们可能会在没有理由的情况下强制执行信念,其次,它们对于确保多次修订的主要目标是不必要的。相反,条件保存原则保证了对正在修改的句子集的适当处理。我们形式化了排序函数的多次命题修正原则,并提出了一些符合AGM和达尔文理论的多次迭代修正的新假设。珍珠假设。我们表明,只需几个基本假设就足以涵盖(多次)迭代信念修正的主要方法,并且Thielscher, Jin和Delgrande意义上的独立性是可选的。作为概念证明,我们提出了排序函数的命题c-修正。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
What kind of independence do we need for multiple iterated belief change?

Multiple iterated revision requires advanced belief revision techniques that are able to integrate several pieces of new information into epistemic states. A crucial feature of this kind of revision is that the multiple pieces of information should be dealt with separately. Previous works have proposed several independence postulates which should ensure this. In this paper, we argue, first, that these postulates are too strong as they may enforce beliefs without justification, and second, that they are not necessary to ensure the principal aim of multiple revision. Instead, principles of conditional preservation guarantee a suitable handling of sets of sentences under revision. We formalize such a principle for multiple propositional revision for ranking functions, and we propose some novel postulates for multiple iterated revision that are in line with AGM and the Darwiche & Pearl postulates. We show that just a few fundamental postulates are enough to cover major approaches to (multiple) iterated belief revision, and that independence in the sense of Thielscher, Jin, and Delgrande is optional. As a proof of concept, we present propositional c-revisions of ranking functions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Applied Logic
Journal of Applied Logic COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
1.13
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Cessation.
期刊最新文献
Editorial Board Editorial Board Formal analysis of SEU mitigation for early dependability and performability analysis of FPGA-based space applications Logical Investigations on Assertion and Denial Natural deduction for bi-intuitionistic logic
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1