Two Approaches to Iterated Belief Contraction

  • Raghav Ramachandran
  • Abhaya C. Nayak
  • Mehmet A. Orgun
Conference paper

DOI: 10.1007/978-3-642-10488-6_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5914)
Cite this paper as:
Ramachandran R., Nayak A.C., Orgun M.A. (2009) Two Approaches to Iterated Belief Contraction. In: Karagiannis D., Jin Z. (eds) Knowledge Science, Engineering and Management. KSEM 2009. Lecture Notes in Computer Science, vol 5914. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Raghav Ramachandran
    • 1
  • Abhaya C. Nayak
    • 1
  • Mehmet A. Orgun
    • 1
  1. 1.Department of ComputingMacquarie UniversityAustralia

Personalised recommendations