In previous work [BGHK92, BGHK93], we have studied the random-worlds approach--a particular (and quite powerful) method for generating degrees of belief (i.e., subjective probabil...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Abstract. We propose a very general syntactical notion of epistemic state and a compact axiomatization for iterated revision when the new information is an epistemic state. We set ...
We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the singleagent case, based on the notion of interpretation, to th...