A topological characterisation of belief revision over infinite propositional languages

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8862 pp. 77 - 90
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail[Pricai14]-A topological characterisation.pdf Published version249.77 kB
Adobe PDF
© Springer International Publishing Switzerland 2014. Belief revision mainly concerns how an agent updates her belief with new evidence. The AGM framework of belief revision models belief revision as revising theories by propositions. To characterise AGMstyle belief revision operators, Grove proposed in 1988 a representation model using systems of spheres. This ‘spheres’ model is very influential and has been extended to characterise multiple belief revision operators. Several fundamental problems remain unsettled regarding this ‘spheres’ model. In this paper we introduce a topology on the set of all worlds of an infinite propositional language and use this topology to characterise systems of spheres. For each AGM operator ◦, we show that, among all systems of spheres deriving ◦, there is a minimal one which is contained in every other system. We give a topological characterisation of these minimal systems. Furthermore, we propose a method for extending an AGM operator to a multiple revision operator and show by an example that the extension is not unique. This negatively answers an open problem raised by Peppas.
Please use this identifier to cite or link to this item: