Actions and Belief Revision : A Computational Approach
The classic AGM theory studies mathematically idealized models of
belief revision in two aspects: the properties (i.e., the AGM postulates)
a rational revision operator should satisfy; and how to mathematically
construct concrete revision operators. In scenarios where new
information arrives in sequence, rational revision operators should
also respect postulates for iterated revision (e.g., the DP postulates).
When applications are concerned, the idealization of the AGM theory has
to be lifted, in particular, beliefs of an agent should be represented by
a finite belief base. In this talk, we present a computational base
revision operator, which satisfies the AGM postulates and some nice
postulates for iterated revision. We will also give a formal assessment
of the base revision operator in terms of its computational complexity
and degree of syntax irrelevance.
Iterated Belief Revision
Belief Base Revision
Computational Complexity
1-25
Regular Paper
Yi
Jin
Yi Jin
Michael
Thielscher
Michael Thielscher
10.4230/DagSemProc.05321.5
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode