JY. Halpern IBM Research Division, Almaden Research Center, Dept. K53/902, 659 Harry Road, San Jose, CA 95120-6099, USA. Email: email@example.com
We extend the notion of 'only knowing' introduced by J. Y. Halpern and Y. Moses to many agents and to a number of modal logics. In this approach, 'all an agent knows is [alpha]' is true in a structure
Mif, in M, the agent knows [alpha] and has a maximum set of 'possibilities'. To extend this approach, we need to make precise what counts as a 'possibility'. In the single-agent case, we can identify a possibility with a truth assignment. In the multi-agent case, things are more complicated. We consider three notions of possibility (all related). We argue that the first is most appropriate for non-introspective logics, such as K n, T n, and S4 n, the second is most appropriate for K45 nand KD45 n, and the last is most appropriate for S5 n. With the appropriate notion of possibility, we show that are reasonable extensions in all cases. Our results also shed light on the single-agent case. It was always assumed that one of the key aspects of the Halpern-Moses approach in the single-agent case was its use of S5, rather than K45 or KD45. Our results show that the notion is better understood in the context of K45 (or KD45). In the single-agent case, the notion remains unchanged if we use K45 instead of S5. However, in the multi-agent case, there are significant differences between K45 and S5. Moreover, in some sense, the K45 variants behave better: all results proved for the single-agent case extend more naturally to the multi-agent case of K45 than to the multi-agent case of S5. : Epistemic logic, S5, KD45, K45, knowledge, belief, ignorance
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Last updated 25 Jan 97
Part of the OUP Journals World Wide Web service.
Copyright Oxford University Press, 1997