Chapter

Knowledge Science, Engineering and Management

Volume 5914 of the series Lecture Notes in Computer Science pp 78-89

Two Approaches to Iterated Belief Contraction

  • Raghav RamachandranAffiliated withDepartment of Computing, Macquarie University
  • , Abhaya C. NayakAffiliated withDepartment of Computing, Macquarie University
  • , Mehmet A. OrgunAffiliated withDepartment of Computing, Macquarie University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Iterated Belief Contraction is a relatively less explored area in belief change and intuition for it is often driven by work in the area of iterated belief revision. For many of the iterable belief contraction functions defined in the literature, very little is known about their properties. In this paper we recall two iterable contraction functions, Natural contraction and Priority contraction, defined by Nayak and colleagues. Here we characterize both these contraction functions via some simple properties of iterated contraction.