Belief Manipulation Through Propositional Announcements

  title={Belief Manipulation Through Propositional Announcements},
  author={Aaron Hunter and François Schwarzentruber and Eric Tsang},
  booktitle={International Joint Conference on Artificial Intelligence},
Public announcements cause each agent in a group to modify their beliefs to incorporate some new piece of information, while simultaneously being aware that all other agents are doing the same. Given a set of agents and a set of epistemic goals, it is natural to ask if there is a single announcement that will make each agent believe the corresponding goal. This problem is known to be undecidable in a general modal setting, where the presence of nested beliefs can lead to complex dynamics. In… 

Figures from this paper

How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements

This paper provides two characterisation theorems for the existence of announcements in the context of model-preference definable revision operators and provides matching optimal lower bounds for the Dalal and Ginsberg operators.

What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario

It is shown that under weak conditions about the rationality of the revision operators used by the agents, the set of candidate formulae has the form of a logical interval, and how the bounds of this interval can be tightened when the revision operato are known and/or when μ is known to be independent from a given set of variables.

GenC: A Fast Tool for Applications Involving Belief Revision

GenC is described, a tool that is able to quickly calculate the result of AGM belief revision for formulas with hundreds of variables and millions of clauses and can be used as a stand-alone tool or as a component of a reasoning system for a variety of applications.

Modelling deception using theory of mind in multi-agent systems

This work is one of the first attempts in AI that uses Theory of Mind along with components of IMT2 and IDT in order to analyse deceptive interactions and implements such a model.

Deceptive Autonomous Agents

This work aims to model and study how artificial agents that deceive and detect deception can be engineered, as well as how such agents might impact the common good.



Arbitrary Announcements in Propositional Belief Revision

This paper is interested in finding a single announcement that will make each agent believe the corresponding goal following AGM-style belief revision, and it is argued that propositional announcements and beliefs are sufficient for modelling many practical problems, including simple robot controllers.

What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability

An extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement that gives a perspective on Fitch's knowability issues and gives completeness for a Hilbert-style axiomatisation of this logic.

Private Revision in a Multi-Agent Setting

This work investigates the changes induced by a new piece of objective information made available to one agent in the set represented by a KD45n model and points out an adaptation of AGM revision postulates to this setting, and presents some specific revision operators.

Iterated Belief Revision, Revised

Arbitrary Public Announcement Logic with Mental Programs

This work proposes a variant of arbitrary public announcement logic which is decidable and provides a proof-of-concept to show its expressiveness, and uses this framework to reason about epistemic properties and arbitrary announcements when agents are cameras located in the plane.

Trust-Sensitive Belief Revision

This paper defines trust as a pre-processing step before revision, and demonstrates that this form of trust can be captured by associating a state partition with each agent, then relativizing all reports to this partition before revising.

Undecidability for arbitrary public announcement logic

A proof that the satisfiability problem for arbitrary public announcement logic (AP AL) is co-RE complete is presented, via a tiling argument.

Iterated Belief Revision

This is a discussion of the problem of extending the basic AGM belief revision theory to iterated belief revision: the problem of formulating rules, not only for revising a basic belief state in

On the Logic of Iterated Belief Revision

Dynamic logic for belief revision

  • J. Benthem
  • Philosophy
    J. Appl. Non Class. Logics
  • 2007
This work shows how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added, and obtains complete logics for concrete mechanisms of belief revision based on compositional reduction axioms.