Abstract: General type-2 fuzzy logic systems have drawn great attentions in recent years, and type-reduction is still the kernel block of the systems. The Enhanced Karnik-Mendel (EKM) algorithm is the most popular type-reduction algorithm. According to the alpha-planes representation theory of general type-2 fuzzy sets, this paper proposes a binary-search enhanced Karnik-Mendel (BEKM) algorithm to perform the centroid type-reduction of general type-2 fuzzy logic systems. In case of choosing the same sampling rate of primary variables, two computer simulation examples show that, compared with the EKM algorithm, the BEKM algorithm has higher computational efficiency without losing the calculation accuracy.

Key words: general type-2 fuzzy logic system, type-reduction, enhanced Karnik-Mendel algorithm, binary-search enhanced Karnik-Mendel algorithm, computer simulation