Fitting fuzzy switching functions to uncertain knowledge

An uncertain reasoning algorithm based on fuzzy switching functions is proposed. The algorithm takes a piece of uncertain knowledge which is a mapping with a restricted domain and outputs the logic formula with the shortest distance to the given mapping. The execution is done in three steps. First, the given mapping is divided into some Q-equivalent classes; second, the distances between the mapping and each local fuzzy switching function are calculated by a simplified logic formula; and last, the shortest distance is obtained by a modified graph-theoretic algorithm