On Structured Belief Bases - Preliminary

نویسنده

  • Renata Wassermann
چکیده

In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].

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

ثبت نام

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

منابع مشابه

On Structured Belief Bases -

In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].

متن کامل

Renata Wassermann on Structured Belief Bases

Most existing approaches to belief revision describe the behaviour of a highly idealized rational agent. In operations of belief change for more realistic agents, usually only a small part of an agent's beliefs is accessed at one time. This should be taken into account if we are looking for cognitively more appropriate operations. Furthermore, it makes implementation more feasible. In this pape...

متن کامل

Merging Locally Correct Knowledge Bases: A Preliminary Report

Belief integration methods are often aimed at deriving a single and consistent knowledge base that retains as much as possible of the knowledge bases to integrate. The rationale behind this approach is the minimal change principle: the result of the integration process should differ as less as possible from the knowledge bases to integrate. We show that this principle can be reformulated in ter...

متن کامل

On consistent belief functions

In this paper we define the class of consistent belief functions as the counterparts of consistent knowledge bases in classical logic. We prove that such class can be defined univocally no matter our definition of proposition implied by a belief function. As consistency can be desirable in decision making, the problem of transforming an arbitrary belief function into a consistent one arise, and...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2007