Chapter

Declarative Agent Languages and Technologies III

Volume 3904 of the series Lecture Notes in Computer Science pp 141-154

Resource-Bounded Belief Revision and Contraction

  • Natasha AlechinaAffiliated withSchool of Computer Science, University of Nottingham
  • , Mark JagoAffiliated withSchool of Computer Science, University of Nottingham
  • , Brian LoganAffiliated withSchool of Computer Science, University of Nottingham

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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 our agent.