Revising Partial Pre-Orders with Partial Pre-Orders: A Unit-Based Revision Framework

نویسندگان

  • Jianbing Ma
  • Salem Benferhat
  • Weiru Liu
چکیده

Belief revision studies strategies about how agents revise their belief states when receiving new evidence. Both in classical belief revision and in epistemic revision, a new input is either in the form of a (weighted) propositional formula or a total pre-order (where the total pre-order is considered as a whole). However, in some real-world applications, a new input can be a partial pre-order where each unit that constitutes the partial pre-order is important and should be considered individually. To address this issue, in this paper, we study how a partial preorder representing the prior epistemic state can be revised by another partial pre-order (the new input) from a different perspective, where the revision is conducted recursively on the individual units of partial pre-orders. We propose different revision operators (rules), dubbed the extension, match, inner and outer revision operators, from different revision points of view. We also analyze several properties for these operators.

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

ثبت نام

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

منابع مشابه

Revision over Partial Pre-orders: A Postulational Study

Belief revision is the process that incorporates, in a consistent way, a new piece of information, called input, into a belief base. When both belief bases and inputs are propositional formulas, a set of natural and rational properties, known as AGM postulates, have been proposed to define genuine revision operations. This paper addresses the following important issue : How to revise a partiall...

متن کامل

Non-characterizability of belief revision: an application of finite model theory

A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a definability property of the class of partial orders in monadic second-order logic. Based on a non-definability result for a class of partial orders, an exampl...

متن کامل

Normal Forms for Priority Graphs

This brief note compares a few ways of deriving pre-orders over sets of objects from strict partial orders over properties of those objects— so-called priority graphs that have recently been used by logicians as a rich explicit model of preference merge, belief revision, norm change, and other aspects of agency. Our note establishes equivalence results between three popular formats for priority...

متن کامل

Partial Orders on Partial Isometries

This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than another with respect to these pre-orders is equivalent to the existence of a bounded (or isometric) multiplier between two natural reproducing kernel Hilbert spac...

متن کامل

Reasoning with partially ordered information in a possibilistic logic framework

In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete knowledge. Possibilistic logic, which is an extension of classical logic, deals with totally ordered inf...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2012