Logic for rough sets with rough double stone algebraic semantics

  • Authors:

  • Jian-Hua Dai

  • Affiliations:

  • Institute of Artificial Intelligence, Zhejiang University, Hangzhou, P.R. China

  • Venue:
  • RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Many researchers study rough sets from the point of view of description of the rough set pairs(a rough set pair is also called a rough set), i.e. . An important result is that the collection of rough sets of an approximation space can be made into a regular double Stone algebra. In this paper, a logic for rough sets, i.e., the sequent calculus corresponding to rough double Stone algebra, is proposed. The syntax and semantics are defined. The soundless and completeness are proved.