Abstract
AbstractIn an earlier paper [Rational choice and AGM belief revision, Artificial Intelligence, 2009] a correspondence was established between the set-theoretic structures of revealed-preference theory (developed in economics) and the syntactic belief revision functions of the AGM theory (developed in philosophy and computer science). In this paper we extend the re-interpretation of those structures in terms of one-shot belief revision by relating them to the trichotomous attitude towards information studied in Garapa (Rev Symb Logic, 1–21, 2020) where information may be either (1) fully accepted or (2) rejected or (3) taken seriously but not fully accepted. We begin by introducing the syntactic notion of filtered belief revision and providing a characterization of it in terms of a mixture of both AGM revision and contraction. We then establish a correspondence between the proposed notion of filtered belief revision and the above-mentioned set-theoretic structures, interpreted as semantic partial belief revision structures. We also provide an interpretation of the trichotomous attitude towards information in terms of the degree of implausibility of the information.
Publisher
Springer Science and Business Media LLC
Subject
Linguistics and Language,Philosophy,Computer Science (miscellaneous)
Reference45 articles.
1. Alchourrón, C., Gärdenfors, P., & Makinson, D. (1985). On the logic of theory change: Partial meet contraction and revision functions. The Journal of Symbolic Logic, 50, 510–530.
2. Bonanno, G. (2009). Rational choice and AGM belief revision. Artificial Intelligence, 173, 1194–1203.
3. Bonanno, G. (2019). Credible information, allowable information and belief revision—extended abstract. In L. S. Moss (Ed.), Proceedings seventeenth conference on theoretical aspects of rationality and knowledge, Toulouse, France, 17–19 July 2019, volume 297 of electronic proceedings in theoretical computer science (pp. 82–90). Open Publishing Association.
4. Booth, R., Fermé, E., Konieczny, S., & Pérez, R. P. (2012). Credibility-limited revision operators in propositional logic. In Thirteenth international conference on the principles of knowledge representation and reasoning (pp. 116–125). AAAI Publications.
5. Booth, R., Fermé, E., Konieczny, S., & Pérez, R. P. (2014). Credibility-limited improvement operators. Frontiers in artificial intelligence and applications. In T. Schaub, G. Friedrich, & B. O’Sullivan (Eds.), ECAI 2014 (Vol. 263, pp. 123–128). IOS Press.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Moderated revision;International Journal of Approximate Reasoning;2024-03
2. System of Spheres-based Two Level Credibility-limited Revisions;Electronic Proceedings in Theoretical Computer Science;2023-07-11