Learn More
Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of(More)
In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for(More)
Over the years many easily computable strategies for the game of Mastermind have been proposed. In this paper we present a new strategy (at least to our knowledge) that performs better than the well-known strategies: guess the code that has the highest number of possible answers. It is motivated and compared to four well-known strategies. Some empirical(More)
We add assignment operators to languages for epistemic actions, so that change of knowledge and change of facts can be combined in specifications of multi-agent system dynamics. We make a distinction between 'public assignment' and 'atomic assignment'. Public assignment means that the entire group of agents is aware of the factual change. This operation(More)
In this paper I combine the dynamic epistemic logic of Gerbrandy (1999) with the prob-abilistic logic of Fagin and Halpern (1994). The result is a new probabilistic dynamic epistemic logic, a logic for reasoning about probability, information, and information change that takes higher order information into account. Probabilistic epistemic models are(More)