Theoretical study of granular computing

  • Authors:
  • Qing Liu;Hui Sun

  • Affiliations:
  • Department of Computer Science & Technology, Nanchang Institute of Technology, Nanchang, China;Department of Computer Science & Technology, Nanchang Institute of Technology, Nanchang, China

  • Venue:
  • RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a higher order logic called as the granular logic. This logic is introduced as a tool for investigating properties of granular computing. In particular, constants of this logic are of the form m(F), where F is a formula (e.g., Boolean combination of descriptors) in a given information system. Truth values of the granular formula are discussed. The truth value of a given formula in a given model is defined by a degree to which the meaning of this formula in the given model is close to the universe of objects. Our approach generalizes the rough truth concept introduced by Zdzisław Pawlak in 1987. We present an axiomatization of granular logic. The resolution reasoning in the axiomatic systems is illustrated by examples, and the resolution soundness is also proved