Characterizability in Belief Revision
Abstract
A formal framework is given for the postulate characterizability of a class of belief revision operators, obtained from a class of partial preorders using minimization. It is shown that for classes of posets characterizability is equivalent to a special kind of definability in monadic second-order logic, which turns out to be incomparable to first-order definability. Several examples are given of characterizable and non-characterizable classes. For example, it is shown that the class of revision operators obtained from posets which are not total is not characterizable.
Cite
Text
Turán and Yaggie. "Characterizability in Belief Revision." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Turán and Yaggie. "Characterizability in Belief Revision." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/turan2015ijcai-characterizability/)BibTeX
@inproceedings{turan2015ijcai-characterizability,
title = {{Characterizability in Belief Revision}},
author = {Turán, György and Yaggie, Jon},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {3236-3242},
url = {https://mlanthology.org/ijcai/2015/turan2015ijcai-characterizability/}
}