A study of possible-worlds semantics of relevance-sensitive belief revision

Author:

Aravanis Theofanis12,Peppas Pavlos1,Williams Mary-Anne3

Affiliation:

1. Department of Business Administration, School of Economics & Business, University of Patras, Patras 265 00, Greece

2. Department of Mechanical Engineering, School of Engineering, University of the Peloponnese, Patras 263 34, Greece

3. Centre for Artificial Intelligence, FEIT, University of Technology Sydney, Australia

Abstract

Abstract Parikh’s relevance-sensitive axiom (P) for belief revision is open to two different interpretations, i.e. the weak and the strong version of (P), both of which are plausible depending on the context. Given that strong (P) has not received the attention it deserves, in this article, an extended examination of it is conducted. In particular, we point out interesting properties of the semantic characterization of the strong version of (P), as well as a vital feature of it that, potentially, results in a significant drop on the resources required for an implementation of a belief-revision system. Lastly, we shed light on the natural connection between global and local revision functions, via their corresponding semantic characterization, hence, a means for constructing global revision functions from local ones, and vice versa, is provided.

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Reference30 articles.

1. On the logic of theory change: partial meet contraction and revision functions;Alchourrón;Journal of Symbolic Logic,1985

2. Full characterization of Parikh’s relevance-sensitive axiom for belief revision;Aravanis;Journal of Artificial Intelligence Research,2019

3. An investigation of parametrized difference revision operators;Aravanis,2019

4. On the strong version of Parikh’s relevance-sensitive axiom for belief revision;Aravanis,2019

5. Language features for flexible handling of exceptions in information systems;Borgida;ACM Transactions on Database Systems,1985

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision;ACM Transactions on Computational Logic;2023-01-27

2. Incorporating Belief Merging into Relevance-Sensitive Belief Structures;Proceedings of the 26th Pan-Hellenic Conference on Informatics;2022-11-25

3. An ASP-based solver for parametrized-difference revision;Journal of Logic and Computation;2021-10-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3