{"title":"Credibility-Limited Revision for Epistemic Spaces","authors":"Kai Sauerwald","doi":"arxiv-2409.07119","DOIUrl":null,"url":null,"abstract":"We consider credibility-limited revision in the framework of belief change\nfor epistemic spaces, permitting inconsistent belief sets and inconsistent\nbeliefs. In this unrestricted setting, the class of credibility-limited\nrevision operators does not include any AGM revision operators. We extend the\nclass of credibility-limited revision operators in a way that all AGM revision\noperators are included while keeping the original spirit of credibility-limited\nrevision. Extended credibility-limited revision operators are defined\naxiomatically. A semantic characterization of extended credibility-limited\nrevision operators that employ total preorders on possible worlds is presented.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider credibility-limited revision in the framework of belief change
for epistemic spaces, permitting inconsistent belief sets and inconsistent
beliefs. In this unrestricted setting, the class of credibility-limited
revision operators does not include any AGM revision operators. We extend the
class of credibility-limited revision operators in a way that all AGM revision
operators are included while keeping the original spirit of credibility-limited
revision. Extended credibility-limited revision operators are defined
axiomatically. A semantic characterization of extended credibility-limited
revision operators that employ total preorders on possible worlds is presented.