Multi-Agent Only Knowing

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear, Journal of Logic and Computation

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Multi-Agent Only Knowing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multi-Agent Only Knowing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-Agent Only Knowing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-240554

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.