概念粒计算系统外延的判别定理

The Extension Discriminant Theorems of Concept Granule Computing System

概念粒计算系统是基于两个完备格之间的外延内涵算子和内涵外延算子构成的模型系统,它包括经典概念格,L模糊概念格及变精度概念格等。本文以三种概念粒计算系统为模型研究了概念外延的特征及其相互关系,给出了外延为经典集、内涵为模糊集和外延为模糊集、内涵为经典集这两种概念粒计算系统的概念外延判别定理,并且讨论了几种模型概念之间的关系与性质。

Concept granule computing system is a model system based on extension intension operator and intension extension operator between two complete lattices. Classic concept lattice, L-fuzzy concept lattice and variable precision concept lattice, etc are included in concept granule computing systems. In this paper, the characteristics o; extension and mutual relations in three concept granule computing systems are researched. Concept extension discriminant theorems of two concept granule computing systems that extension is classic set, intension is fuzzy set, and the reverse are represented. The properties and relations of several model concepts are also discussed.