Resource-Bounded Belief Revision and Contraction
نویسندگان
چکیده
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, and revise their beliefs by incorporating a new belief which may be inconsistent with their previous beliefs. An influential theory of belief change proposed by Alchourron, Gärdenfors and Makinson (AGM) [1] describes postulates which rational belief revision and contraction operations should satisfy. The AGM postulates are usually taken as characterising idealised rational reasoners, and the corresponding belief change operations are considered unsuitable for implementable agents due to their high computational cost [2]. The main result of this paper is to show that an efficient (linear time) belief contraction operation nevertheless satisfies all but one of the AGM postulates for contraction. This contraction operation is defined for an implementable rule-based agent which can be seen as a reasoner in a very weak logic; although the agent’s beliefs are deductively closed with respect to this logic, checking consistency and tracing dependencies between beliefs is not computationally expensive. Finally, we give a non-standard definition of belief revision in terms of contraction for
منابع مشابه
Belief revision for rule-based agents
Agents which perform inferences on the basis of possibly unreliable information need an ability to revise their beliefs if they discover an inconsistency. However, most belief revision algorithms for classical reasoners have quite high complexity, which makes them unsuitable for resource-bounded reasoners. We consider belief revision for agents which reason in a simpler logic that the full firs...
متن کاملKnowledge State Reconsideration: Hindsight Belief Revision
As a knowledge representation and reasoning (KRR) system gathers and reasons about information, it has to update its belief space to maintain consistency. Some belief change operations it can perform include expansion (addition with no consistency checking), contraction (aka removal or retraction), revision (consistent prioritized addition), and consolidation (elimination of any and all inconsi...
متن کاملIterated Belief Contraction from First Principles
Importance of contraction for belief change notwithstanding, literature on iterated belief change has by and large centered around the issue of iterated belief revision, ignoring the problem of iterated belief contraction. In this paper we examine iterated belief contraction in a principled way, starting with Qualified Insertion, a proposal by Hans Rott. We show that a judicious combination of ...
متن کاملDynamic Belief Hierarchies
In this paper we introduce and formalise dynamic belief hierarchies. We give a formal deenition of beliefs, which requires that they are coherent; that is, that each belief is jointly consistent with every other belief which the agent considers at least as reliable. Thus an agent's beliefs cannot be deened independently, but only with reference to the agent's existing belief hierarchy. We then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005