All You Ever Wanted to Know about Tweety (But Were Afraid to Ask)

نویسنده

  • Gerhard Lakemeyer
چکیده

We propose a formalization of only-knowing-about, which captures the idea that something is all an agent knows about some subject matter. The work extends a previous formalization of only-knowing by Levesque. Besides discussing some of the logical properties of the new concept, we also address the issue of computing what is known about some subject matter for a given knowledge base. In this context, we are able to relate only-knowing-about to deKleer's ATMS. Finally , we show that only-knowing-about is eeciently computable, if we weaken the underlying model of belief. In Lev90], Levesque proposes a formalization of the concept of only-knowing. This notion, which captures the idea that something is all an agent knows, 1 has proven very valuable in characterizing the knowledge of a fully introspective agent. In particular, Levesque uses it to reconstruct and in fact generalize Moore's autoepistemic logic within the framework of a classical (monotonic) logic. While a logic of only-knowing is thus very useful from a theoretical point of view, being able to talk about all an agent knows does not seem very relevant from a practical point of view, say, as part of a query language. After all, hardly anybody is interested in all I know. 2 A much more useful concept in this regard seems to be the notion of only-knowing-about, where one is interested in all the agent knows about a certain subject matter. Thus queries like is this all you know about Tweety or what do you know about Tweety seem very appropriate. Another application is a multi-agent scenario where agents reason about other agents, possibly applying defaults. For example, assume there are two agents, Jack and Jill, with the default that birds y unless known otherwise being common knowledge. If Jill knows 1 We will freely use the terms knowledge and belief interchangeably. While all of the logics discussed here allow an agent to have false beliefs, none of our results hinges on this choice. 2 Besides, for a knowledge-based agent it is a trivial matter to tell a user all it knows. It only needs to hand over a copy of its knowledge base.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Everything You Ever Wanted to Know About DTDs, But Were Afraid to Ask

For the last two years, XML has become an increasingly popular data-format embraced by a lot of di erent communities. XML is extremely attractive because it o ers a simple, intuitive and uniform textbased syntax and is extensible. One can nd today XML proposals for messages, text content delivery and presentation, data content, documents, software components, scienti c data, real-estate ads, na...

متن کامل

A Primer in Synchrotron Radiation: Everything You Wanted to Know about SEX (Synchrotron Emission of X-rays) but Were Afraid to Ask.

The basic properties of synchrotron radiation are derived with simple approaches, emphasizing phenomena rather than mathematical details.

متن کامل

All You Ever Wanted to Know About Molt But Were Afraid to Ask Part II: Finding Order Amid the Chaos

640 Part 1 of this review (Birding, October 2003, pp. 490–496) discussed examples of the seemingly endless variations possible in molt strategies worldwide, relating to when and where a bird molts. These variations come about through the interplay of several underlying factors that can be summarized as: 1) environment and food; 2) breeding and size; and 3) migration. In Part 2 we’ll look at how...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992