Abstract
There are different models to characterize AGM belief revision framework. When the background language is finite propositional language, Katsuno and Mendelzon (KM) proposed in 1991 a representation model using total preorder on worlds. This ‘preorder’ model is very influential and has been extended to characterize epistemic state in iterated belief revision. KM showed an approach how to construct the preorder via a belief set and an AGM belif revision operator, however, this approach does not work well when the language is infinite. In this paper, we argue when the language is infinite propositional language, how to construct a preorder on world to model AGM belief revision framework, and then we generalize the representation theorem of KM over an infinite language.
Cite
CITATION STYLE
Meng, H., Yuan, Y., Chu, J., & Wang, H. (2015). Belief revision over infinite propositional language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9403, pp. 844–854). Springer Verlag. https://doi.org/10.1007/978-3-319-25159-2_79
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
