Respecting Relevance in Belief Change
نویسندگان
چکیده
In this paper dedicated to Carlos Alchourrón, we review an issue that emerged only after his death in 1996, but would have been of great interest to him: To what extent do the formal operations of AGM belief change respect criteria of relevance? A natural (but also debateable) criterion was proposed in 1999 by Rohit Parikh, who observed that the AGM model does not always respect it. We discuss the pros and cons of this criterion, and explain how the AGM account may be refined, if we so desire, so that it is always respected.
منابع مشابه
Partial Meet Contraction Based On Relevance Criterion∗
An agent usually holds a very large number of beliefs. Hopefully, efficient belief changes should be performed only in the part of its relevant states at a time. Parikh showed that AGM belief change operations do not always respect his relevance criterion. Kourousias and Makinson showed that they will do so if the given belief set K is in canonical form K′. However, even when K is closed under ...
متن کاملExploring Relevance as Truth Criterion on the Web and Classifying Claims in Belief Levels
The Web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the Web. Moreover, different websites often provide conflicting information on a subject. Several truth discovery methods have been proposed for various scenarios, and they have been successfully applied in diverse application domains. In this paper...
متن کاملLanguage Splitting and Relevance-Based Belief Change in Horn Logic
This paper presents a framework for relevance-based belief change in propositional Horn logic. We firstly establish a parallel interpolation theorem for Horn logic and show that Parikh’s Finest Splitting Theorem holds with Horn formulae. By reformulating Parikh’s relevance criterion in the setting of Horn belief change, we construct a relevance-based partial meet Horn contraction operator and p...
متن کاملParallel interpolation, splitting, and relevance in belief change
The splitting theorem says that any set of formulae has a finest representation as a family of letter-disjoint sets. Parikh formulated this for classical propositional logic, proved it in the finite case, used it to formulate a criterion for relevance in belief change, and showed that AGM partial meet revision can fail the criterion. In this paper we make three further contributions. We begin b...
متن کاملKernel Contraction and Base Dependence: Redundancy in the Base Resulting in Different Types of Dependence
The AGM paradigm of belief change studies the dynamics of belief states in light of new information. Finding, or even approximating, dependent or relevant beliefs to a change is valuable because, for example, it can narrow the set of beliefs considered during belief change operations. Gärdenfors’ preservation criterion (GPC) suggests that formulas independent of a belief change should remain in...
متن کامل