Displaying similar documents to “The similarity of two strings of fuzzy sets”

Towards a fuzzy computability?

Claudio Moraga (1999)

Mathware and Soft Computing

Similarity:

The subject of the present paper is the study of fuzzy computability based on fuzzy Turing machines. Two different models of fuzzy Turing machines will be discussed. It is shown that most work on fuzzy mathematics may be conducted within the frame of classical computability and the rest falls within the area of computability of the reals.

An architecture for making judgments using computing with words

Jerry Mendel (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our thesis is that computing with words needs to account for the uncertainties associated with the meanings of words, and that these uncertainties require using type-2 fuzzy sets. Doing this leads to a proposed architecture for making it judgments by means of computing with words, i.e., to a perceptual computer-the Per-C. The Per-C includes an encoder, a type-2 rule-based fuzzy logic system, and a decoder. It lets all human-computer interactions be performed using words. In this paper,...

Interpretability of linguistic variables: a formal account

Ulrich Bodenhofer, Peter Bauer (2005)

Kybernetika

Similarity:

This contribution is concerned with the interpretability of fuzzy rule-based systems. While this property is widely considered to be a crucial one in fuzzy rule-based modeling, a more detailed formal investigation of what “interpretability” actually means is not available. So far, interpretability has most often been associated with rather heuristic assumptions about shape and mutual overlapping of fuzzy membership functions. In this paper, we attempt to approach this problem from a...