Rough contraction through partial meets

  • Authors:

  • Mohua Banerjee;Pankaj Singh

  • Affiliations:

  • Department of Mathematics and Statistics, Indian Institute of Technology, Kanpur, India;Department of Mathematics and Statistics, Indian Institute of Technology, Kanpur, India

  • Venue:
  • PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
  • Year:
  • 2005

  • Belief revision

    Handbook of logic in artificial intelligence and logic programming (Vol. 4)

  • Rough Consequence and Rough Algebra

    RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper addresses the problem of constructing rough belief change functions. Contraction and revision postulates using the notion of rough consequence and rough consistency have been proposed in [2]. The base logic is a reasoning framework $\mathcal{L}_{\mathcal{R}}$, that has a semantics of rough truth. We demonstrate here that functions satisfying the contraction postulates can be constructed through the method of partial meets [1]. As a result, a construction of rough revision functions is also obtained.