Multi-Agent Only Knowing
| dc.creator | Halpern, Joseph Y. | |
| dc.creator | Lakemeyer, Gerhard | |
| dc.date | 2000-01-19 | |
| dc.date.accessioned | 2026-07-07T03:15:51Z | |
| dc.date.available | 2026-07-07T03:15:51Z | |
| dc.description | Levesque introduced a notion of ``only knowing'', with the goal of capturing certain types of nonmonotonic 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 reexamine 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. | |
| dc.description | To appear, Journal of Logic and Computation | |
| dc.identifier | https://arxiv.org/abs/cs/0001015 | |
| dc.identifier | http://arxiv.org/abs/cs/0001015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30135 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | I.2.4, F.4.1 | |
| dc.title | Multi-Agent Only Knowing | |
| dc.type | text |