How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements
Abstract
Consider a set of agents with initial beliefs and a formal operator for incorporating new information. Now suppose that, for each agent, we have a formula that we would like them to believe. Does there exist a single announcement that will lead all agents to believe the corresponding formula? This paper studies the problem of the existence of such an announcement in the context of model-preference definable revision operators. First, we provide two characterisation theorems for the existence of announcements: one in the general case, the other for total partial orderings. Second, we exploit the characterisation theorems to provide upper bound complexity results. Finally, we also provide matching optimal lower bounds for the Dalal and Ginsberg operators.
Cite
Text
Eiter et al. "How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements." International Joint Conference on Artificial Intelligence, 2021. doi:10.24963/IJCAI.2021/257Markdown
[Eiter et al. "How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements." International Joint Conference on Artificial Intelligence, 2021.](https://mlanthology.org/ijcai/2021/eiter2021ijcai-hard/) doi:10.24963/IJCAI.2021/257BibTeX
@inproceedings{eiter2021ijcai-hard,
title = {{How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements}},
author = {Eiter, Thomas and Hunter, Aaron and Schwarzentruber, François},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2021},
pages = {1866-1872},
doi = {10.24963/IJCAI.2021/257},
url = {https://mlanthology.org/ijcai/2021/eiter2021ijcai-hard/}
}