Home  Online Resources  Table of Contents

Journal of Logic and Computation, Volume 11, Issue 1, pp. 41-70: Abstract.

Multi-agent Only Knowing

Joseph Y. Halpern1, and Gerhard Lakemeyer2

1Department of Computer Science, Cornell University, Ithaca, NY 14850, USA. E-mail: halpern@cs.cornell.eduhttp://www.cs.cornell.edu/home/halpern
2Department of Computer Science, Aachen University of Technology, D-52056 Aachen, GermanyE-mail: gerhard@cs.rwth-aachen.dehttp://www-i5.informatik.rwth-aachen.de/gerhard

Levesque introduced a notion of `only knowing', with the goal of capturing certain types of non-monotonic reasoning. Levesque's logic dealt with only the case of a single agent. Recently, both Halpern and Lakemeyer independently attempted to extend Levesque's logic to the multi-agent case. Although there are a number of similarities in their approaches, there are some significant differences. In this paper, we re-examine the notion of only knowing, going back to first principles. In the process, we simplify Levesque's completeness proof, and point out some problems with the earlier definitions. This leads us to reconsider what the properties of only knowing ought to be. We provide an axiom system that captures our desiderata, and show that it has a semantics that corresponds to it. The axiom system has an added feature of interest: it includes a modal operator for satisfiability, and thus provides a complete axiomatization for satisfiability in the logic K45.

Keywords: Belief, only knowing, nonmonotonic reasoning, multi-, agent systems, KD45

  Full-Text PDF  (320 KB)

[ Oxford University Press]   [ Oxford Journals]   [ Comments & Feedback]   Copyright© Oxford University Press, 2001.