Reasoning about only knowing with many agents

  • Authors:
  • Joseph Y. Halpern

  • Affiliations:
  • IBM Almaden Research Center, San Jose, CA

  • Venue:
  • AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend two notions of "only knowing", that of Halpern and Moses [1984], and that of Levesque [1990], to many agents. The main lesson of this paper is that these approaches do have reasonable extensions to the multi-agent case. Our results also shed light on the single-agent case. For example, it was always viewed as significant that the HM notion of only knowing was based on S5, while Levesque's was based on K45. In fact, our results show that the HM notion is better understood in the context of K45. Indeed, in the singleagent case, the HM notion remains unchanged if we use K45 (or KD45) instead of S5. However, In the multiagent case, there are significant differences between K45 and S5. Moreover, all the results proved by Halpern and Moses for the single-agent case extend naturally to the multi-agent case for K45, but not for S5.