Learn More
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are a dded. The core engine consists of definable update rules(More)
where non-final nodes are turns for unique players, with outgoing transitions as moves for that player. Final nodes have no outgoing moves. Technically, such structures are models for a poly-modal(More)